Infinitary lambda calculi from a linear perspective

From MaRDI portal
Publication:4635902

DOI10.1145/2933575.2934505zbMATH Open1394.03027arXiv1604.08248OpenAlexW2531157181MaRDI QIDQ4635902FDOQ4635902

Ugo Dal Lago

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Abstract: We introduce a linear infinitary lambda-calculus, called ellLambdainfty, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted coinductively. The obtained calculus embeds the infinitary applicative lambda-calculus and is universal for computations over infinite strings. What is particularly interesting about ellLambdainfty, is that the refinement induced by linear logic allows to restrict both modalities so as to get calculi which are terminating inductively and productive coinductively. We exemplify this idea by analysing a fragment of ellLambda built around the principles of mathsfSLL and mathsf4LL. Interestingly, it enjoys confluence, contrarily to what happens in ordinary infinitary lambda-calculi.


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




Recommendations





Cited In (13)





This page was built for publication: Infinitary lambda calculi from a linear perspective

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