Abstract
The notion of Σ-monoids is proposed by Fiore, Plotkin and Turi, to give abstract algebraic model of languages with variable binding and substitutions. In this paper, we give a free construction of Σ-monoids. The free Σ-monoid over a given presheaf serves a well-structured term language involving binding and substitutions. Moreover, the free Σ-monoid naturally contains interesting syntactic objects which can be viewed as “metavariables” and “environments”. We analyse the term language of the free Σ-monoid by relating it with several concrete systems, especially the λ-calculus extended with contexts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: Proc. 14th Annual Symposium on Logic in Computer Science, pp. 193–202 (1999)
Ghani, N., Uustalu, T.: Explicit substitutions and higher order syntax. In: Proceedings of 2nd ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2003, pp. 135–146 (2003)
Hamana, M.: A logic programming language based on binding algebras. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 243–262. Springer, Heidelberg (2001)
Hamana, M.: Term rewriting with variable binding: An initial algebra approach. In: Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2003). ACM Press, New York (2003)
Hashimoto, M., Ohori, A.: A typed context calculus. Theoretical Computer Science 266, 249–271 (2001)
Mac Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer, New York (1971)
Mason, I.A.: Computing with contexts. Higher-Order and Symbolic Computation 12(2), 171–201 (1999)
Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation 186, 165–193 (2003)
Plotkin, G.: Another meta-language for programming with bound names modulo renaming. In: Winter Workshop in Logics, Types and Rewriting, Heriot-Watt University (February 2000) (Lecture slides)
Sands, D.: Computing with contexts: A simple approach. In: Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II). Electronic Notes in Theoretical Computer Science, vol. 10 (1998)
Sato, M., Sakurai, T., Burstall, R.: Explicit environments. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 340–354. Springer, Heidelberg (1999)
Sato, M., Sakurai, T., Kameyama, Y.: A simply typed context calculus with first-class environments. In: Kuchen, H., Ueda, K. (eds.) FLOPS 2001. LNCS, vol. 2024, pp. 359–374. Springer, Heidelberg (2001)
Sato, M., Sakurai, T., Kameyama, Y., Igarashi, A.: Calculi of meta-variables. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003 and KGC. LNCS, vol. 2803, pp. 484–497. Springer, Heidelberg (2003)
Talcott, C.L.: A theory of binding structures and applications to rewriting. Theoretical Computer Science 112(1), 99–143 (1993)
Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003 and KGC. LNCS, vol. 2803, pp. 513–527. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamana, M. (2004). Free Σ-Monoids: A Higher-Order Syntax with Metavariables. In: Chin, WN. (eds) Programming Languages and Systems. APLAS 2004. Lecture Notes in Computer Science, vol 3302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30477-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-30477-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23724-2
Online ISBN: 978-3-540-30477-7
eBook Packages: Springer Book Archive