Explicit substitions and all that
Abstract
Explicit substitution calculi are extensions of the calculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming languages and proof assistant systems. In this paper we explore new developments on two of the most successful styles of explicit substitution calculi: the λσ- and λsе-calculi.
Keywords: Explicit substitution, higher order uni cation, lambda-calculi, type and rewriting theory.
How to Cite
Downloads
Downloads
Published
Issue
Section
License
The publication of an article in the Colombian Journal of Computing, requires authorization by the author, through the letter of assignment, which authorizes the Editor of this Journal for partial or total reproduction, for academic purposes, not commercial or lucrative, according to the Open Access philosophy on Web sites and on the Internet, such as networks, bibliographic databases, indexes, directories or any other means of electronic reproduction, always referring to the author(s) and the journal, as stipulated in Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Altmetric
| Article metrics | |
|---|---|
| Abstract views | 401 |
| Galley views | 170 |
| PDF Views | 170 |
| HTML views | 0 |
| Other views | 0 |


