Sciweavers

9 search results - page 2 / 2
» wollic 2010
Sort
View
WOLLIC
2010
Springer
13 years 10 months ago
Feasible Functions over Co-inductive Data
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
Ramyaa Ramyaa, Daniel Leivant
WOLLIC
2010
Springer
13 years 10 months ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis
WOLLIC
2010
Springer
13 years 9 months ago
A CTL-Based Logic for Program Abstractions
sed Logic for Program Abstractions Martin Lange1 and Markus Latte2 1 Dept. of Computer Science, University of Kassel, Germany 2 Dept. of Computer Science, Ludwig-Maximilians-Univer...
Martin Lange, Markus Latte
WOLLIC
2010
Springer
13 years 3 months ago
Intersection Type Systems and Explicit Substitutions Calculi
Abstract. The λ-calculus with de Bruijn indices, called λdB, assembles each α-class of λ-terms into a unique term, using indices instead of variable names. Intersection types p...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...