Mostrar el registro sencillo del ítem
Explicit substitions and all that
| dc.creator | Ayala Rincón, Mauricio | |
| dc.creator | Muñoz, César | |
| dc.date | 2000-12-01 | |
| dc.date.accessioned | 2022-03-03T19:57:38Z | |
| dc.date.available | 2022-03-03T19:57:38Z | |
| dc.identifier | https://revistas.unab.edu.co/index.php/rcc/article/view/1128 | |
| dc.identifier.uri | http://test.repositoriodigital.com:8080/handle/123456789/13900 | |
| dc.description | 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. | es-ES |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Autónoma de Bucaramanga | es-ES |
| dc.relation | https://revistas.unab.edu.co/index.php/rcc/article/view/1128/1098 | |
| dc.rights | Derechos de autor 2000 Revista Colombiana de Computación | es-ES |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/4.0 | es-ES |
| dc.source | Revista Colombiana de Computación; Vol. 1 No. 1 (2000): Revista Colombiana de Computación (Julio-Diciembre); 46-72 | en-US |
| dc.source | Revista Colombiana de Computación; Vol. 1 Núm. 1 (2000): Revista Colombiana de Computación (Julio-Diciembre); 46-72 | es-ES |
| dc.source | 2539-2115 | |
| dc.source | 1657-2831 | |
| dc.title | Explicit substitions and all that | es-ES |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion |
Ficheros en el ítem
| Ficheros | Tamaño | Formato | Ver |
|---|---|---|---|
|
No hay ficheros asociados a este ítem. |
|||