A syntactic correspondence between context-sensitive calculi and abstract machines
DOI10.1016/J.TCS.2006.12.028zbMATH Open1111.68065OpenAlexW1981224255MaRDI QIDQ879356FDOQ879356
Authors: Małgorzata Biernacka, Olivier Danvy 
Publication date: 11 May 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.028
Recommendations
continuationsrefocusingdefunctionalizationcontextsreduction semanticsdelimited continuationsenvironment-based machinesexplicit substitutionsproper tail recursionstack inspection
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Title not available (Why is that?)
- Fundamental concepts in programming languages
- Trampolined style
- Recursive functions of symbolic expressions and their computation by machine, Part I
- The Mechanical Evaluation of Expressions
- Definitional interpreters revisited
- Definitional interpreters for higher-order programming languages
- Implementation strategies for first-class continuations
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- An environment machine for the λμ-calculus
- Representing Control: a Study of the CPS Transformation
- Deriving a lazy abstract machine
- Title not available (Why is that?)
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Title not available (Why is that?)
- An introduction to Landin's ``A generalization of jumps and labels
- A generalization of jumps and labels
- An abstract framework for environment machines
- Explicit substitutions
- Continuations revisited
- A Rational Deconstruction of Landin’s SECD Machine
- Scheme: A interpreter for extended lambda calculus
- Title not available (Why is that?)
- A syntactic theory of dynamic binding
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- The first report on scheme revisited
- An early use of continuations and partial evaluation for compiling rules written in first-order predicate calculus
- Continuations: A mathematical semantics for handling full jumps
- On the static and dynamic extents of delimited continuations
- From reduction-based to reduction-free normalization
- A Rational Deconstruction of Landin’s J Operator
- Title not available (Why is that?)
- Functional runtime systems within the lambda-sigma calculus
- Confluence properties of weak and strong calculi of explicit substitutions
- Title not available (Why is that?)
- Making a fast Curry: push/enter vs. eval/apply for higher-order languages
- An Operational Foundation for Delimited Continuations in the CPS Hierarchy
- Computer Science Logic
- THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control
- Logic Based Program Synthesis and Transformation
Cited In (18)
- Title not available (Why is that?)
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- On one-pass CPS transformations
- Title not available (Why is that?)
- A call-by-name lambda-calculus machine
- Inter-deriving semantic artifacts for object-oriented programming
- From outermost reduction semantics to abstract machine
- 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
- A static simulation of dynamic delimited control
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Refunctionalization at work
- On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
- A context-based approach to proving termination of evaluation
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- Inter-deriving Semantic Artifacts for Object-Oriented Programming
- From reduction-based to reduction-free normalization
- On graph rewriting, reduction, and evaluation in the presence of cycles
This page was built for publication: A syntactic correspondence between context-sensitive calculi and abstract machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879356)
