A scheme for a higher-level semantic algebra
Algebraic methods in semantics
Reflections on Landin's J-operator: a partly historical note
Computer Languages
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Notions of computation and monads
Information and Computation
Control-flow analysis of higher-order languages of taming lambda
Control-flow analysis of higher-order languages of taming lambda
Compiling with continuations
A generic account of continuation-passing styles
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Lisp and Symbolic Computation - Special issue on continuations—part I
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
Polymorphic type assignment and CPS conversion
Lisp and Symbolic Computation - Special issue on continuations—part I
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theories of programming languages
Theories of programming languages
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
An Introduction to Landin‘s “A Generalization of Jumps and Labels”
Higher-Order and Symbolic Computation
A Generalization of Jumps and Labels
Higher-Order and Symbolic Computation
Definitional Interpreters for Higher-Order Programming Languages
Higher-Order and Symbolic Computation
Scheme: A Interpreter for Extended Lambda Calculus
Higher-Order and Symbolic Computation
On the Relation between Direct and Continuation Semantics
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Continuation Semantics in Typed Lambda-Calculi (Summary)
Proceedings of the Conference on Logic of Programs
The lambda calculus and its relation to programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Extracting Constructive Content from Classical Proofs
Extracting Constructive Content from Classical Proofs
An Interpreter for Extended Lambda Calculus
An Interpreter for Extended Lambda Calculus
Rabbit: A Compiler for Scheme
LISP 1.5 Programmer's Manual
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
Design and Correctness of Program Transformations Based on Control-Flow Analysis
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Polymorphic typed defunctionalization
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Producing all ideals of a forest, functionally
Journal of Functional Programming
Polymorphic typed defunctionalization and concretization
Higher-Order and Symbolic Computation
On the static and dynamic extents of delimited continuations
Science of Computer Programming
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
Combining algebraic effects with continuations
Theoretical Computer Science
Analyzing the environment structure of higher-order languages using frame strings
Theoretical Computer Science
A concrete framework for environment machines
ACM Transactions on Computational Logic (TOCL)
Higher-Order and Symbolic Computation
Information Processing Letters
Defunctionalized interpreters for programming languages
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Inter-deriving Semantic Artifacts for Object-Oriented Programming
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Science of Computer Programming
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Higher-Order and Symbolic Computation
Inter-deriving semantic artifacts for object-oriented programming
Journal of Computer and System Sciences
From reduction-based to reduction-free normalization
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
A systematic derivation of the STG machine verified in Coq
Proceedings of the third ACM Haskell symposium on Haskell
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
From type checking by recursive descent to type checking with an abstract machine
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
Subtyping delimited continuations
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
A rational deconstruction of landin's j operator
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Defunctionalized interpreters for call-by-need evaluation
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Control-flow analysis of functional programs
ACM Computing Surveys (CSUR)
Theoretical Computer Science
Engineering definitional interpreters
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
A synthetic operational account of call-by-need evaluation
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
To introduce the republication of “Definitional Interpreters for Higher-Order Programming Languages”, the author recounts the circumstances of its creation, clarifies several obscurities, corrects a few mistakes, and briefly summarizes some more recent developments.