Converting between combinatory reduction systems and big step semantics

Authors:
Hanne Gottliebsen;Kristoffer H. Rose
Affiliations:
-;IBM Thomas J. Watson Research Center
Venue:
Semantics and algebraic specification
Year:
2009

Citing 7
Cited 0

Natural semantics

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Action semantics

Action semantics
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution

PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
A rewriting logic approach to operational semantics

Information and Computation
From conditional to unconditional rewriting

WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We make a connection between higher-order rewriting in the form of combinatory reduction systems (CRS) and logic-based operational semantics in the form of big step semantic (BSS) specifications. We show how sets of CRS rewrite rules can be encoded as BSS, and how BSS (including natural semantics) can be encoded as CRS. The connections permit the use of proper variables and substitution in both formalisms.