From Outermost Reduction Semantics to Abstract Machine

DOI10.1007/978-3-319-14125-1_6zbMath1453.68045OpenAlexW2176061503MaRDI QIDQ3453649

Jacob Johannsen, Olivier Danvy

Publication date: 30 November 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-14125-1_6

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Unnamed Item

Uses Software

• PLT Redex

Cites Work

• A syntactic correspondence between context-sensitive calculi and abstract machines
• Termination of rewriting
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• A syntactic approach to type soundness
• The origins of structural operational semantics
• Twenty years of rewriting logic
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• From Reduction-Based to Reduction-Free Normalization
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• A concrete framework for environment machines

This page was built for publication: From Outermost Reduction Semantics to Abstract Machine