Converting between Combinatory Reduction Systems and Big Step Semantics

DOI10.1007/978-3-642-04164-8_15MaRDI QIDQ3184752zbMATH OpenOpenAlexFDO

Authors Hanne Gottliebsen, Kristoffer H. Rose

Publication date 22 October 2009

Published in Semantics and Algebraic Specification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04164-8_15

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• Combinatory reduction systems: Introduction and survey
• From nominal to higher-order rewriting and back again
• Expressing combinatory reduction systems derivations in the rewriting calculus
• The Rewriting Calculus as a Combinatory Reduction System
• Relating nominal and higher-order rewriting

Cites work

• scientific article; zbMATH DE number 4035108 (Why is no real title available?)
• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 6168355 (Why is no real title available?)
• A rewriting logic approach to operational semantics
• Action Semantics
• Conditional rewriting logic as a unified model of concurrency
• Recent Trends in Algebraic Development Techniques

Cited in

(2)

• Deriving Pretty-Big-Step Semantics from Small-Step Semantics
• From nominal to higher-order rewriting and back again

Describes a project that uses

Uses Software

• CRSX

This page was built for publication: Converting between Combinatory Reduction Systems and Big Step Semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184752)