Automating the functional correspondence between higher-order evaluators and abstract machines

DOI10.1007/978-3-030-98869-2_3zbMath1521.68033arXiv2108.07132OpenAlexW3195672379MaRDI QIDQ6102250

Maciej Buszka, Dariusz Biernacki

Publication date: 8 May 2023

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.07132

zbMATH Keywords

abstract machinecontinuation-passing styledefunctionalizationevaluator

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inter-deriving semantic artifacts for object-oriented programming
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Definitional interpreters for higher-order programming languages
• An abstract machine for strong call by value
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• Structural attacks for public key cryptosystems based on Gabidulin codes
• A call-by-name lambda-calculus machine
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
• Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
• From operational semantics to abstract machines
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• A Selective CPS Transformation
• Abstracting abstract machines
• An Operational Foundation for Delimited Continuations in the CPS Hierarchy
• From Natural Semantics to Abstract Machines
• Logic Based Program Synthesis and Transformation
• The Mechanical Evaluation of Expressions

This page was built for publication: Automating the functional correspondence between higher-order evaluators and abstract machines