A syntactic correspondence between context-sensitive calculi and abstract machines
type: Item
instance of: scholarly article
title: A syntactic correspondence between context-sensitive calculi and abstract machines
zbMATH Open document ID: 1111.68065
author: Małgorzata Biernacka
author: Olivier Danvy
published in: Theoretical Computer Science
publication date: 2007-05-11T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N18
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5151774
zbMATH Keywords: refocusing
zbMATH Keywords: reduction semantics
zbMATH Keywords: contexts
zbMATH Keywords: continuations
zbMATH Keywords: delimited continuations
zbMATH Keywords: defunctionalization
zbMATH Keywords: explicit substitutions
zbMATH Keywords: environment-based machines
zbMATH Keywords: proper tail recursion
zbMATH Keywords: stack inspection
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.12.028
OpenAlex ID: W1981224255
cites work: Explicit substitutions
cites work: A functional correspondence between call-by-need evaluators and lazy abstract machines
cites work: A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
cites work: Q4449226
cites work: An Operational Foundation for Delimited Continuations in the CPS Hierarchy
cites work: Logic Based Program Synthesis and Transformation
cites work: THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control
cites work: On the static and dynamic extents of delimited continuations
cites work: Q3667969
cites work: Q3750108
cites work: Implementation strategies for first-class continuations
cites work: Q3785893
cites work: An abstract framework for environment machines
cites work: Confluence properties of weak and strong calculi of explicit substitutions
cites work: Q4518878
cites work: A Rational Deconstruction of Landin’s SECD Machine
cites work: From reduction-based to reduction-free normalization
cites work: Representing Control: a Study of the CPS Transformation
cites work: A Rational Deconstruction of Landin’s J Operator
cites work: An environment machine for the λμ-calculus
cites work: Trampolined style
cites work: Functional runtime systems within the lambda-sigma calculus
cites work: Computer Science Logic
cites work: The Mechanical Evaluation of Expressions
cites work: A generalization of jumps and labels
cites work: Making a fast curry
cites work: Recursive functions of symbolic expressions and their computation by machine, Part I
cites work: A syntactic theory of dynamic binding
cites work: Q4255509
cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus
cites work: Definitional interpreters for higher-order programming languages
cites work: Definitional interpreters revisited
cites work: An early use of continuations and partial evaluation for compiling rules written in first-order predicate calculus
cites work: Deriving a lazy abstract machine
cites work: Fundamental concepts in programming languages
cites work: Continuations: A mathematical semantics for handling full jumps
cites work: The first report on scheme revisited
cites work: Scheme: A interpreter for extended lambda calculus
cites work: An introduction to Landin's ``A generalization of jumps and labels''
cites work: Continuations revisited
DOI: 10.1016/J.TCS.2006.12.028
description: scientific article; zbMATH DE number 5151774