Abstract Computing Machines: A Lambda Calculus PerspectiveSpringer Science & Business Media, 18.02.2005 - 384 Seiten The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines. |
Inhalt
Contents | 1 |
Algorithms and Programs 11 | 10 |
An Algorithmic Language | 37 |
The XCalculus 51 | 50 |
Calculus Machines | 113 |
The BMachine | 175 |
The GMachine | 192 |
The πRED Machinery | 215 |
Another Functional Abstract Machine 271 | 270 |
Imperative Abstract Machines | 289 |
Real Computing Machines 321 | 320 |
A InputOutput | 347 |
BOn Theorem Proving | 361 |
References 369 | 367 |
| 377 | |
Pattern Matching | 253 |
Andere Ausgaben - Alle anzeigen
Abstract Computing Machines: A Lambda Calculus Perspective Werner Kluge Eingeschränkte Leseprobe - 2005 |
Abstract Computing Machines: A Lambda Calculus Perspective Werner Kluge Keine Leseprobe verfügbar - 2005 |
Abstract Computing Machines: A Lambda Calculus Perspective Werner Kluge Keine Leseprobe verfügbar - 2009 |
Häufige Begriffe und Wortgruppen
A-calculus A-expression abstract machine abstraction body abstractors activation record addressing modes algorithms apply nodes arity basic binding indices bound variables Chap closures code execution computation configuration construct constructor context copy defined denotes empty entries environment pointer EVAL evaluation free variables full normal forms function calls function code G-code G-machine graph reduction head normal form head-order heap high-level if_then_else implementation index tuple instantiated instruction lambda language letrec machine code n-extension 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 SE(M)CD machine SECD machine Sect semantics sequence specified spine ẞ-reductions stack pointer statement block step string structure substituted supercombinator suspensions syntactical terminates topmost trace stack tuple update weakly normalizing workspace λυ