Sciweavers

650 search results - page 56 / 130
» Logical Bisimulations and Functional Languages
Sort
View
TLCA
2005
Springer
14 years 1 months ago
A Lambda Calculus for Quantum Computation with Classical Control
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...
Peter Selinger, Benoît Valiron
ICFP
2007
ACM
14 years 7 months ago
Relating complexity and precision in control flow analysis
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 ...
David Van Horn, Harry G. Mairson
ICFCA
2004
Springer
14 years 1 months ago
Background Knowledge in Concept Graphs
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...
Frithjof Dau
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 7 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
TCS
2011
13 years 2 months ago
Realizability models and implicit complexity
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 ...
Ugo Dal Lago, Martin Hofmann