Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition

Autores
Arbiser, Ariel; Bonelli, Eduardo; Ríos, Alejandro
Año de publicación
2002
Idioma
español castellano
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
We study perpetual rewrite strategies (strategies that preserve the possibility of in finite derivations) in the λws-calculus, a lambda calculus with explicit substitutions allowing the composition of substitutions. Since current literature on perpetuality is not applicable to λws we exploit a proof technique for proving preservation of strong normalization of calculi of explicit substitutions. We de fine a perpetual rewrite strategy for λws and formulate an inductive characterization of the set of strongly λws-normalizing terms.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Cálculo
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/183649

id SEDICI_ee709c9bb5bfa1f7cc726c31181b0bc2
oai_identifier_str oai:sedici.unlp.edu.ar:10915/183649
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Perpetuality in a Lambda Calculus with Explicit Substitutions and CompositionArbiser, ArielBonelli, EduardoRíos, AlejandroCiencias InformáticasCálculoWe study perpetual rewrite strategies (strategies that preserve the possibility of in finite derivations) in the λws-calculus, a lambda calculus with explicit substitutions allowing the composition of substitutions. Since current literature on perpetuality is not applicable to λws we exploit a proof technique for proving preservation of strong normalization of calculi of explicit substitutions. We de fine a perpetual rewrite strategy for λws and formulate an inductive characterization of the set of strongly λws-normalizing terms.Sociedad Argentina de Informática e Investigación Operativa2002-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1-25http://sedici.unlp.edu.ar/handle/10915/183649spainfo:eu-repo/semantics/altIdentifier/issn/1666-1133info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:50:07Zoai:sedici.unlp.edu.ar:10915/183649Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:50:07.939SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition
title Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition
spellingShingle Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition
Arbiser, Ariel
Ciencias Informáticas
Cálculo
title_short Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition
title_full Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition
title_fullStr Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition
title_full_unstemmed Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition
title_sort Perpetuality in a Lambda Calculus with Explicit Substitutions and Composition
dc.creator.none.fl_str_mv Arbiser, Ariel
Bonelli, Eduardo
Ríos, Alejandro
author Arbiser, Ariel
author_facet Arbiser, Ariel
Bonelli, Eduardo
Ríos, Alejandro
author_role author
author2 Bonelli, Eduardo
Ríos, Alejandro
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Cálculo
topic Ciencias Informáticas
Cálculo
dc.description.none.fl_txt_mv We study perpetual rewrite strategies (strategies that preserve the possibility of in finite derivations) in the λws-calculus, a lambda calculus with explicit substitutions allowing the composition of substitutions. Since current literature on perpetuality is not applicable to λws we exploit a proof technique for proving preservation of strong normalization of calculi of explicit substitutions. We de fine a perpetual rewrite strategy for λws and formulate an inductive characterization of the set of strongly λws-normalizing terms.
Sociedad Argentina de Informática e Investigación Operativa
description We study perpetual rewrite strategies (strategies that preserve the possibility of in finite derivations) in the λws-calculus, a lambda calculus with explicit substitutions allowing the composition of substitutions. Since current literature on perpetuality is not applicable to λws we exploit a proof technique for proving preservation of strong normalization of calculi of explicit substitutions. We de fine a perpetual rewrite strategy for λws and formulate an inductive characterization of the set of strongly λws-normalizing terms.
publishDate 2002
dc.date.none.fl_str_mv 2002-09
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/183649
url http://sedici.unlp.edu.ar/handle/10915/183649
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1666-1133
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
1-25
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616360732131328
score 13.070432