Abstract Computing Machines: A Lambda Calculus PerspectiveSpringer Science & Business Media, 02/12/2005 - 384 من الصفحات The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines. |
المحتوى
| 1 | |
| 10 | |
An Algorithmic Language | 37 |
The λCalculus 51 | 50 |
The semcd Machine and Others | 89 |
Toward FullFledged λCalculus Machines | 113 |
Interpreted HeadOrder Graph Reduction 149 | 148 |
The BMachine | 171 |
The GMachine 193 | 192 |
Real Computing Machines 321 | 320 |
A InputOutput | 347 |
B On Theorem Proving | 361 |
References 369 | 368 |
| 377 | |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
abstract machine abstraction body abstractors activation record addressing modes algorithms apply nodes argument arity basic binding indices bound variables Chap closures code execution computation configuration construct constructor context copy copytw defined denotes empty entries environment pointer eval evaluation frame free variables freet full normal forms function calls function code Functional Programming G-code G-machine graph reduction head normal form head-order heap high-level implementation instantiated instruction lambda language letrec machine code nested offsets operand expressions operator parameters partial applications pattern abstractions pattern matching primitive function procedure calls program counter pushed q q q recursively reduce referenced return continuation rule runtime se(m)cd machine secdi machine Sect semantics sequence specified spine statement block step string structure substituted supercombinator suspensions syntactical tail terminates topmost trace stack tuple update weakly normalizing workspace