Computer Science – Logic in Computer Science
Scientific paper
2010-04-21
Computer Science
Logic in Computer Science
Scientific paper
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.
Tasson Christine
Vaux Lionel
No associations
LandOfFree
Transport of finiteness structures and applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Transport of finiteness structures and applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transport of finiteness structures and applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-326563