Sciweavers

CSL
2009
Springer
14 years 2 months ago
Intersection, Universally Quantified, and Reference Types
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
Mariangiola Dezani-Ciancaglini, Paola Giannini, Si...
CSL
2009
Springer
14 years 3 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
CSL
2009
Springer
14 years 3 months ago
Confluence of Pure Differential Nets with Promotion
We study the confluence of Ehrhard and Regnier's differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence ...
Paolo Tranquilli
CSL
2009
Springer
14 years 3 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
CSL
2009
Springer
14 years 4 months ago
Upper Bounds on Stream I/O Using Semantic Interpretations
This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
Marco Gaboardi, Romain Péchoux
CSL
2009
Springer
14 years 6 months ago
The Ackermann Award 2009
Johann A. Makowsky, Alexander A. Razborov
CSL
2009
Springer
14 years 6 months ago
Cardinality Quantifiers in MLO over Trees
Vince Bárány, Lukasz Kaiser, Alexand...
CSL
2009
Springer
14 years 6 months ago
Nominal Domain Theory for Concurrency
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...
David Turner, Glynn Winskel
CSL
2009
Springer
14 years 6 months ago
Decidable Extensions of Church's Problem
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
Alexander Rabinovich
CSL
2009
Springer
14 years 6 months ago
Kleene's Amazing Second Recursion Theorem
Yiannis N. Moschovakis