Strong normalizability as a finiteness structure via the Taylor expansion of -terms

From MaRDI portal
Publication:2811355

DOI10.1007/978-3-662-49630-5_24zbMATH Open1476.03009arXiv1603.07218OpenAlexW2305850023MaRDI QIDQ2811355FDOQ2811355


Authors: Michele Pagani, Christine Tasson, Lionel Vaux Edit this on Wikidata


Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic {lambda}-calculus by introducing a finiteness structure on resource terms, which is such that a {lambda}-term is strongly normalizing iff the support of its Taylor expansion is finitary. An application of our result is the existence of a normal form for the Taylor expansion of any strongly normalizable non-deterministic {lambda}-term.


Full work available at URL: https://arxiv.org/abs/1603.07218




Recommendations



Cites Work


Cited In (11)





This page was built for publication: Strong normalizability as a finiteness structure via the Taylor expansion of \(\lambda\)-terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811355)