4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Needed reduction and spine strategies for the lambda calculus
Information and Computation
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
A natural semantics for lazy evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Full abstraction in the lazy lambda calculus
Information and Computation
ML for the working programmer (2nd ed.)
ML for the working programmer (2nd ed.)
Correspondence between ALGOL 60 and Church's Lambda-notation: part I
Communications of the ACM
The next 700 programming languages
Communications of the ACM
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
The Definition of Standard ML
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Deriving a lazy abstract machine
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
TILC: The Interactive Lambda-Calculus Tracer
Electronic Notes in Theoretical Computer Science (ENTCS)
The very lazy λ-calculus and the STEC machine
IFL'09 Proceedings of the 21st international conference on Implementation and application of functional languages
An output-based semantics of Λμ with explicit substitution in the π-calculus: extended abstract
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
We describe lambda calculus reduction strategies, such as call-by-value, call-by-name, normal order, and applicative order, using big-step operational semantics. We show how to simply and efficiently trace such reductions, and use this in a web-based lambda calculus reducer available at 〈http://www.dina.kvl.dk/~sestoft/lamreduce/〉.