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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benaissa, Z.-E.-A., Lescanne, P., Rose, K.H.: Modeling sharing and recursion for weak reduction strategies using explicit substitution. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 393–407. Springer, Heidelberg (1996)
Despeyroux, J.: Proof of Translation in Natural Semantics. In: Symposium on Logic in Computer Science (LICS 1986), pp. 193–205 (1986)
Gottliebsen, H.: Combinatory Reduction Systems and Natural Semantics. Master’s thesis, DAIMI, Aarhus University (1998)
Kahn, G.: Natural Semantics. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 22–39. Springer, Heidelberg (1987)
Klop, J.W.: Combinatory Reduction Systems. Mathematisch Centrum, Amsterdam (1980)
Klop, J.W.: Term Rewriting Systems. In: Handbook of Logic in Computer Science, vol. 2, pp. 1–116. Clarendon Press, Oxford (1992)
Marchiori, M.: On deterministic conditional rewriting, MIT Laboratory for Computer Science, vol. 405, Computation Structures Group Memo (1997)
Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96, 73–155 (1992)
Mosses, P.D.: SIS–semantics implementation system. Technical Report Daimi MD-30, Computer Science Department, Aarhus University (out of print) (1979)
Mosses, P.D.: Action semantics. Cambridge University Press, New York (1992)
Ohlebush, E.: Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705. Springer, Heidelberg (1999)
Plotkin, G.D.: A structural approach to operational semantics. Technical Report FN-19, DAIMI, Aarhus Universitet (1981)
Rose, K.H.: CRSX: Combinatory Reduction Systems with Extensions. SourceForge (2007–2009), http://crsx.sf.net
Rose, K.H.: Explicit Substitution - Tutorial & Survey. Lecture Series LS-96-3, BRICS, Aarhus Universitet (1996)
Rosu, G.: From Conditional to Unconditional Rewriting. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, pp. 218–233. Springer, Heidelberg (2005)
Serbanuta, T., Rosu, G., Meseguer, J.: A Rewriting Logic Approach to Operational Semantics. Information and Computation 207(2) (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gottliebsen, H., Rose, K.H. (2009). Converting between Combinatory Reduction Systems and Big Step Semantics . In: Palsberg, J. (eds) Semantics and Algebraic Specification. Lecture Notes in Computer Science, vol 5700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04164-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-04164-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04163-1
Online ISBN: 978-3-642-04164-8
eBook Packages: Computer ScienceComputer Science (R0)