Lambda Calculus and Intuitionistic Linear Logic

Studia Logica 59 (3):417-448 (1997)
Abstract
The introduction of Linear Logic extends the Curry-Howard Isomorphism to intensional aspects of the typed functional programming. In particular, every formula of Linear Logic tells whether the term it is a type for, can be either erased/duplicated or not, during a computation. So, Linear Logic can be seen as a model of a computational environment with an explicit control about the management of resources
Keywords linear logic  Curry-Howard isomorphism  typed λ-calculi
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,304
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Sara Negri (2002). Varieties of Linear Calculi. Journal of Philosophical Logic 31 (6):569-590.
Andreja Prijatelj (1995). Reflections on “Difficult” Embeddings. Journal of Philosophical Logic 24 (1):71 - 84.
Ruggero Pagnan (2013). Syllogisms in Rudimentary Linear Logic, Diagrammatically. Journal of Logic, Language and Information 22 (1):71-113.
Analytics

Monthly downloads

Added to index

2010-08-31

Total downloads

5 ( #210,215 of 1,096,373 )

Recent downloads (6 months)

3 ( #84,313 of 1,096,373 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.