Converting between Combinatory Reduction Systems and Big Step Semantics

DOI10.1007/978-3-642-04164-8_15zbMATH Open1253.68212OpenAlexW1583887781MaRDI QIDQ3184752FDOQ3184752

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

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

Mathematics Subject Classification ID

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

Cites Work

• Conditional rewriting logic as a unified model of concurrency
• A rewriting logic approach to operational semantics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Action Semantics
• Recent Trends in Algebraic Development Techniques
• Title not available (Why is that?)

Cited In (2)

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

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)