650 search results - page 56 / 130 » Logical Bisimulations and Functional Languages |
TLCA
2005
Springer
15 years 4 months ago
2005
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
104
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
108
click to vote
ICFCA
2004
Springer
15 years 4 months ago
2004
Springer
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
CORR
2004
Springer
14 years 11 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...
TCS
2011
14 years 6 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...