Abstract Computing Machines: A Lambda Calculus PerspectiveSpringer Science & Business Media, 18/02/2005 - 384 من الصفحات The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines. |
المحتوى
Contents | 1 |
Algorithms and Programs 11 | 10 |
An Algorithmic Language | 36 |
The XCalculus 51 | 50 |
The GMachine | 192 |
The πRED Machinery | 215 |
Pattern Matching | 253 |
Another Functional Abstract Machine 271 | 270 |
Imperative Abstract Machines | 289 |
Real Computing Machines 321 | 320 |
A InputOutput | 347 |
B On Theorem Proving | 361 |
References 369 | 367 |
| 377 | |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
A-calculus A-expressions abstract machine abstraction body abstractors activation record algorithms apply nodes arity basic binding indices bound variables C[es Chap closures code execution computation configuration construct constructor context copy defined denotes e₁ empty entries environment pointer EVAL evaluation free variables full normal forms function calls function code Functional Programming G-code G-machine graph reduction head normal form head-order heap high-level if_then_else implementation index tuple instantiated instruction lambda language lasm letrec nested offsets operand expressions operator outermost parameters partial applications pattern abstractions pattern matching pops primitive function procedure calls program counter push recursively reduced referenced return continuation rule runtime SECD machine Sect semantics sequence specified spine ẞ-reductions stack pointer statement block step string structure substituted supercombinator suspensions syntactical tail terminates topmost trace stack tuple update weakly normalizing workspace