Replies: 4 comments
-
Just let me clarify something that I think might have confused some readers. In Turing machines, you do have a tape where all computations are performed, which is an essential part of the machine itself. On the other hand, in lambda calculus you have the input expression and the computation is performed by successively applying reduction rules, making the input expression to achieve its normal form. Of course, realistically speaking, you need something to store this expression when emulating it in von Neumann based machines, and this is done using its memory, which is size bounded and hence you have a limit for which expressions can be computed. The thing is, the memory itself is not a core part of this computation scheme, so it doesn't make sense to talk about allocating memory inside a lambda expression. For this particular reason, the garbage collector is not a primitive inside this machine. However, you do need to allocate memory when emulating this machine to contain any growing lambda expressions. So, an implementation of this emulator could use garbage collection to make things easier. But, as @VictorTaelin found out with the multiple implementations, you don't need garbage collection. I hope I made the things clearer :) |
Beta Was this translation helpful? Give feedback.
-
No worry, I think no one reading this kind of thread has been confused. We know the stuff. |
Beta Was this translation helpful? Give feedback.
-
Note: most of these things are old stepping stones to get where I am, and should mostly be ignored. What is currently up-to-date is:
All the other things are past/outdated iterations of these concepts. Don't read these or you'll just get confused. I'll answer the questions later. |
Beta Was this translation helpful? Give feedback.
-
All right, I'm glad to be able to confirm HOVM is based on SIC's theory because reading your blog posts, I've had a strong feeling so far it's the ultimate conclusion for your lambda-calculus research so far. Now the outline of the projects also in historical context is clear to me. Thank you. |
Beta Was this translation helpful? Give feedback.
-
I'd like to confirm the theoretical background of HOVM.
I've read;
#14 (comment) @leonardohn
This is extremely interesting, especially;
My assumption right now is this VM is a successor of
parallel_lambda_computer_tests
optlam -> Absal -> Symmetric-Interaction-Calculus
The Symmetric Interaction Calculus
->
EA-NET +
Elementary Affine Core (EA-CORE) (Specification)
FM-NET +
FM-CORE (Formality-Core)
Formality-Core/Whitepaper.md
Soonad/Whitepaper
->
HOVM
Am I correct?
Please let me know.
Thanks.
Beta Was this translation helpful? Give feedback.
All reactions