Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2019-11-04T15:16:07Z
dc.date.available 2019-11-04T15:16:07Z
dc.date.issued 2005-03-01
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/84837
dc.description.abstract Explicit substitutions (ES) were introduced as a bridge between the theory of rewrite systems with binders and substitution, such as the λ-calculus, and their implementation. In a seminal paper Melliès observed that the dynamical properties of a rewrite system and its ES-based implementation may not coincide: he showed that a strongly normalising term (i.e. one which does not admit infinite derivations) in the λ-calculus may lose this status in its ES-based implementation. This paper studies normalisation for the latter systems in the general setting of higher-order rewriting: Based on recent work extending the theory of needed strategies to non-orthogonal rewrite systems we show that needed strategies normalise in the ES-based implementation of any orthogonal pattern higher-order rewrite system. en
dc.format.extent 91-125 es
dc.language en es
dc.subject Explicit substitutions es
dc.subject Higher-order rewriting es
dc.subject Lamda calculus es
dc.subject Needed-strategies es
dc.subject Normalisation es
dc.subject Normalización es
dc.subject Estrategias es
dc.subject Cálculo es
dc.subject Substituciones explícitas es
dc.title Normalisation for higher-order calculi with explicit substitutions en
dc.type Articulo es
sedici.identifier.other http://dx.doi.org/10.1016/j.tcs.2004.10.019 es
sedici.identifier.issn 0304-3975 es
sedici.creator.person Bonelli, Eduardo es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Informática es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.description.peerReview peer-review es
sedici.relation.journalTitle Theoretical Computer Science es
sedici.relation.journalVolumeAndIssue vol. 333, no. 1-2 es
sedici.rights.sherpa * RoMEO: verde* Pre-print del autor: can* Post-print del autor: can* Versión de editor/PDF:cannot* Condiciones:>>Authors pre-print on any website, including arXiv and RePEC>>Author's post-print on author's personal website immediately>>Author's post-print on open access repository after an embargo period of between 12 months and 48 months>>Permitted deposit due to Funding Body, Institutional and Governmental policy or mandate, may be required to comply with embargo periods of 12 months to 48 months>>Author's post-print may be used to update arXiv and RepEC>>La versión de editor/PDF no puede utilizarse>>Debe enlazar a la versión de editor con DOI>>Author's post-print must be released with a Creative Commons Attribution Non-Commercial No Derivatives License>>Publisher last reviewed on 03/06/2015* Link a Sherpa: http://sherpa.ac.uk/romeo/issn/0304-3975/es/


Descargar archivos

Thumbnail
Documento completo
Descargar archivo (695.0Kb) - PDF

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)