Abstract
Reflexive combinatory logic RCL was introduced by S. Artemov as an extension of typed combinatory logic CL → capable to internalize its own derivations of typing judgments. It was designed as a basic theoretical prototype of functional programming languages extended by this kind of self-referential capacity. However, its operational aspects remained to be clarified. We study reductions for reflexive combinatory logic and prove strong normalization and confluence properties. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Shamkanov, D. S. (2011). Strong normalization and confluence for reflexive combinatory logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6642 LNAI, pp. 228–238). Springer Verlag. https://doi.org/10.1007/978-3-642-20920-8_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
