A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Meta Lambda Calculus with Cross-Level Computation
2015
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15
We propose meta lambda calculus λ * as a basic model of textual substitution via metavariables. The most important feature of the calculus is that every β-redex can be reduced regardless of whether the β-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 α-renaming in the presence of meta-level variables. We overcome the difficulty by introducing a new mechanism to deal with
doi:10.1145/2676726.2676976
dblp:conf/popl/Tobisawa15
fatcat:c74zlkaz4nhtbmiyqrw4cw75vy