Definitional interpreters for higher-order programming languages

DOI10.1023/A:1010027404223MaRDI QIDQ1290337zbMATH OpenWikidataFDO

Authors John C. Reynolds

Publication date 31 May 1999

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

lambda calculushigher-order programming languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Recommendations

• Definitional interpreters revisited
• Scheme: A interpreter for extended lambda calculus
• One method of defining the semantics of programming language constructs in terms of lambda calculus. II
• On interpretation of functional programming languages

Cited in

(40)

• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
• A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
• Soundness conditions for big-step semantics
• Liberate abstract garbage collection from the stack by decomposing the heap
• Inter-deriving semantic artifacts for object-oriented programming
• On the relations between monadic semantics
• State-transition machines, revisited
• A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
• Functional semantics
• Polymorphic typed defunctionalization and concretization
• Enhancing dependency pair method using strong computability in simply-typed term rewriting
• Types as graphs: Continuations in type logical grammar
• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
• Embedding an interpreted language using higher-order functions and types
• A selective CPS transformation
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Combining algebraic effects with continuations
• Automating the functional correspondence between higher-order evaluators and abstract machines
• Proof-directed program transformation: a functional account of efficient regular expression matching
• A syntactic correspondence between context-sensitive calculi and abstract machines
• Implementation of an interpreter for abstract equations
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures
• Analyzing the environment structure of higher-order languages using frame strings
• Control-flow analysis of function calls and returns by abstract interpretation
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
• Programming language semantics: It’s easy as 1,2,3
• Getting There and Back Again
• Flattening tuples in an SSA intermediate representation
• Limited second-order functionality in a first-order setting
• A first-order one-pass CPS transformation
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• On the dynamic extent of delimited continuations
• A new interpretor for PARI/GP
• Inter-deriving Semantic Artifacts for Object-Oriented Programming
• Normalization by evaluation for modal dependent type theory
• Agent-Based Modeling and Computer Languages
• Referential transparency, definiteness and unfoldability
• A unifying approach to goal-directed evaluation
• A bounded model checking technique for higher-order programs

Describes a project that uses

Uses Software

• PL/I

This page was built for publication: Definitional interpreters for higher-order programming languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290337)