Definitional interpreters for higher-order programming languages
From MaRDI portal
Publication:1290337
DOI10.1023/A:1010027404223zbMATH Open0934.68034WikidataQ55889895 ScholiaQ55889895MaRDI QIDQ1290337FDOQ1290337
Publication date: 31 May 1999
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Recommendations
Cited In (38)
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Inter-deriving semantic artifacts for object-oriented programming
- State-transition machines, revisited
- On the relations between monadic semantics
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- 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
- Automating the functional correspondence between higher-order evaluators and abstract machines
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Combining algebraic effects with continuations
- Implementation of an interpreter for abstract equations
- A syntactic correspondence between context-sensitive calculi and abstract machines
- On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
- Control-flow analysis of function calls and returns by abstract interpretation
- 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
- 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
- Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap
- Soundness Conditions for Big-Step Semantics
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- Inter-deriving Semantic Artifacts for Object-Oriented Programming
- On the dynamic extent of delimited continuations
- Normalization by evaluation for modal dependent type theory
- Agent-Based Modeling and Computer Languages
- Functional Semantics
- Referential transparency, definiteness and unfoldability
- A Selective CPS Transformation
- A unifying approach to goal-directed evaluation
- Proof-directed program transformation: A functional account of efficient regular expression matching
- A bounded model checking technique for higher-order programs
Uses Software
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)
