14 search results - page 1 / 3 » Light Affine Logic as a Programming Language: A First Contri... |
IJFCS
2000
13 years 7 months ago
2000
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 ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
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...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...