Sciweavers

22 search results - page 1 / 5
» A PolyTime Functional Language from Light Linear Logic
Sort
View
ESOP
2010
Springer
14 years 2 months ago
A PolyTime Functional Language from Light Linear Logic
Patrick Baillot, Marco Gaboardi and Virgile Mogbil
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 4 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
IJFCS
2000
71views more  IJFCS 2000»
13 years 4 months ago
Light Affine Logic as a Programming Language: A First Contribution
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
Luca Roversi
ICFP
2010
ACM
13 years 5 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
ICFP
2012
ACM
11 years 7 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler