Refunctionalization at work
From MaRDI portal
Publication:923881
DOI10.1016/j.scico.2007.10.007zbMath1192.68115OpenAlexW2178095747MaRDI QIDQ923881
Publication date: 24 July 2009
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2007.10.007
continuationsabstract machinescontinuation-passing styledefunctionalizationrefunctionalizationshunting-yard algorithm
Related Items (9)
Peter J. Landin (1930--2009) ⋮ Getting There and Back Again ⋮ Programming language semantics: It’s easy as 1,2,3 ⋮ Inter-deriving Semantic Artifacts for Object-Oriented Programming ⋮ On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation ⋮ On graph rewriting, reduction, and evaluation in the presence of cycles ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ A correspondence between type checking via reduction and type checking via evaluation ⋮ From Reduction-Based to Reduction-Free Normalization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polymorphic typed defunctionalization and concretization
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Definitional interpreters revisited
- Back to direct style
- Abstract computing machines. A lambda calculus perspective.
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- State-transition machines for lambda-calculus expressions
- Strongly reducing variants of the Krivine abstract machine
- State-transition machines, revisited
- On the static and dynamic extents of delimited continuations
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- A compiled implementation of strong reduction
- EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version
- A Rational Deconstruction of Landin's SECD Machine with the J Operator
- Reflections on Landin's J-operator: A partly historical note
- Theories of Programming Languages
- From ML to Ada: Strongly-typed language interoperability via source translation
- Representing Control: a Study of the CPS Transformation
- Producing all ideals of a forest, functionally
- Proof-directed debugging
- An Operational Foundation for Delimited Continuations in the CPS Hierarchy
- Syntactic Analysis and Operator Precedence
- Type-driven defunctionalization
- A Rational Deconstruction of Landin’s SECD Machine
- A constructive approach to the problem of program correctness
- Logic Based Program Synthesis and Transformation
This page was built for publication: Refunctionalization at work
