Abstract
We propose meta lambda calculus Lambda-* as a basic model of textual substitution via metavariables. The most important feature of the calculus is that every beta-redex can be reduced regardless of whether the beta-redex contains meta-level variables or not. Such a meta lambda calculus has never been achieved before due to difficulty to manage binding structure consistently with alpha-renaming in the presence of meta-level variables. We overcome the difficulty by introducing a new mechanism to deal with substitution and binding structure in a systematic way without the notion of free variables and alpha-renaming.
Calculus Lambda-* enables us to investigate cross-level terms that include a certain type of level mismatch. Cross-level terms have been regarded as meaningless terms and left out of consideration thus far. We find that some cross-level terms behave as quotes and `eval' command in programming languages. With these terms, we show a procedural language as an application of the calculus, which sheds new light on the notions of stores and recursion via meta-level variables.
- M. Abadi, L. Cardelli, P.-L. Curien and J.-J. Lévy. 1991. Explicit substitutions. Journal of Functional Programming 1, 4, 375--416.Google Scholar
- Daisuke Bekki. 2009. Monads and meta-lambda calculus. In New Frontiers in Artificial Intelligence (JSAI 2008), LNAI 5447, 193--208.Google Scholar
- Daisuke Bekki and Kenichi Asai. 2010. Representing covert movements by delimited continuations. In New Frontiers in Artificial Intelligence (JSAI-isAI 2009), LNAI 6284, 161--180. Google Scholar
Digital Library
- Mathieu Boespflug and Brigitte Pientka. 2011. Multi-level contextual type theory. In Proceedings of the 6th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice (LFMTP 2011), EPTCS 71, 29--43.Google Scholar
Cross Ref
- N. G. de Bruijn. 1972. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae 75, 5, 381--392.Google Scholar
Cross Ref
- Laurent Dami. 1998. A lambda-calculus for dynamic binding. Theoretical Computer Science 192, 2, 201--231. Google Scholar
Digital Library
- Rowan Davies. 1996. A temporal-logic approach to binding-time analysis. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS '96), 184--195. Google Scholar
Digital Library
- Gilles Dowek, Thérèse Hardin and Claude Kirchner. 2000. Higher order unification via explicit substitutions. Information and Computation 157, 183--235. Google Scholar
Digital Library
- Murdoch J. Gabbay. 2005. A NEW calculus of contexts. In Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP '05), 94--105. Google Scholar
Digital Library
- Murdoch J. Gabbay and Stéphane Lengrand. 2009. The lambda-context calculus (extended version). Information and Computation 207, 12, 1369--1400. Google Scholar
Digital Library
- Murdoch J. Gabbay and Dominic P. Mulligan. 2009. Two-level lambda-calculus. Electronic Notes in Theoretical Computer Science 246, 107--129. Google Scholar
Digital Library
- Masatomo Hashimoto and Atsushi Ohori. 2001. A typed context calculus. Theoretical Computer Science 266, 249--272. Google Scholar
Digital Library
- Moe Masuko and Daisuke Bekki. 2011. Categorical semantics of meta-lambda calculus (in Japanese). In Informal Proceedings of the 13th JSSST Workshop on Programming and Programming Languages, 60--74.Google Scholar
- Aleksandar Nanevski, Brigitte Pientka and Frank Pfenning. 2003. A modal foundation for meta-variables. In Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding (MERLIN '03), 1--6. Google Scholar
Digital Library
- Aleksandar Nanevski, Frank Pfenning and Brigitte Pientka. 2008. Contextual modal type theory. ACM Transactions on Computational Logic 9, 3, Article 23, 49 pages. Google Scholar
Digital Library
- Masahiko Sato, Takafumi Sakurai and Yukiyoshi Kameyama. 2002. A simply typed context calculus with first-class environments. Journal of Functional and Logic Programming 2002, 1--41. Google Scholar
Digital Library
- Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama and Atsushi Igarashi. 2003. Calculi of meta-variables. In Computer Science Logic (CSL 2003), LNCS 2803, 484--497.Google Scholar
- Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama and Atsushi Igarashi. 2008. Calculi of meta-variables. Frontiers of Computer Science in China 2, 1, 12--21.Google Scholar
Cross Ref
Index Terms
A Meta Lambda Calculus with Cross-Level Computation
Recommendations
A Meta Lambda Calculus with Cross-Level Computation
We propose meta lambda calculus Lambda-* as a basic model of textual substitution via metavariables. The most important feature of the calculus is that every beta-redex can be reduced regardless of whether the beta-redex contains meta-level variables or ...







Comments