Transport of finiteness structures and applications
-
Published:2016-12-05
Issue:7
Volume:28
Page:1061-1096
-
ISSN:0960-1295
-
Container-title:Mathematical Structures in Computer Science
-
language:en
-
Short-container-title:Math. Struct. Comp. Sci.
Author:
TASSON CHRISTINE,VAUX LIONEL
Abstract
We describe a general construction of finiteness spaces which subsumes the interpretations of all positive connectors of linear logic. We then show how to apply this construction to prove the existence of least fixpoints for particular functors in the category of finiteness spaces: These include the functors involved in a relational interpretation of lazy recursive algebraic datatypes along the lines of the coherence semantics of system T.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference36 articles.
1. The differential lambda-calculus
2. de Carvalho D. (2008). Execution time of lambda-terms via denotational semantics and intersection types. Technical Report, Rapport de recherche INRIA n° 6638.
3. Domains and Lambda-Calculi
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Taylor Expansion, Finiteness and Strategies;Electronic Notes in Theoretical Computer Science;2019-11