Sciweavers

129 search results - page 3 / 26
» Logic Programming in a Fragment of Intuitionistic Temporal L...
Sort
View
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 5 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
WOLLIC
2007
Springer
13 years 12 months ago
Computational Interpretations of Classical Linear Logic
We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higherorder functionals in the language of ...
Paulo Oliva
PPDP
2005
Springer
13 years 11 months ago
Monadic concurrent linear logic programming
Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In th...
Pablo López, Frank Pfenning, Jeff Polakow, ...
CSL
2002
Springer
13 years 5 months ago
Classical Linear Logic of Implications
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
Masahito Hasegawa
CSL
2009
Springer
14 years 11 days ago
Craig Interpolation for Linear Temporal Languages
We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of te...
Amélie Gheerbrant, Balder ten Cate