|
|
List of Accepted Papers (in no particular order)
Authors: A list of instructions for preparing your camera-ready version is now available.
Please read these instruction carefully. The deadline for submitting your camera-ready version is 18:00 GMT June 1, 2005.
|
Jiri Adamek. A Logic of Coequations
Bruno Courcelle and Christian Delhomme. The Modular Decomposition of
Countable Graphs : Constructions in Monadic Second-Order Logic
Michael Soltys. Feasible Proofs of Matrix Properties with Csanky's
Algorithm
Massimo Franceschet and Balder ten Cate. On the Complexity of Hybrid
Logics with Binders
Carsten Lutz. PDL with Intersection and Converse is Decidable
Matthew Collinson, David Pym and Edmund Robinson. On Bunched
Polymorphism (Extended Abstract)
Tom Murphy, Robert Harper and Karl Crary. Distributed Control Flow
with Classical Modal Logic
Frederic Blanqui. Decidability of Type-checking in the Calculus of
Algebraic Constructions with Size Annotations
Bakhadyr Khoussainov and Sasha Rubin. Decidability of Term Algebras
Extending Partial Algebras
Marcin Mostowski and Konrad Zdanowski. Coprimality in finite models
Paula Severi and Fer-Jan de Vries. Order structures on Boehm-like
models
Julian Bradfield, Jacques Duparc and Sandra Quickert. Transfinite
Extension of the Mu-Calculus
Colin Stirling. Higher-Order Matching and Games
Kaustuv Chaudhuri and Frank Pfenning. Focusing the Inverse Method for
Linear Logic
Mircea-Dan Hernest. Light Functional Interpretation -
an optimization of Goedel's technique towards the extraction of (more)
efficient programs from (classical) proofs
Filip Murlak. On Deciding Topological Classes of Deterministic Tree
Languages
Antonina Kolokolova. Closure properties of weak systems of bounded
arithmetic
Guillem Godoy and Ashish Tiwari. Confluence of Shallow Right-Linear
Rewrite Systems
Steven Perron. A Propositional Proof System for Log Space
Shin-ya Katsumata. A Semantic Formulation of TT-lifting and Logical Predicates
for Computatinal Metalanguage
Emanuel Kieronski. Results on the Guarded Fragment with Equivalence or
Transitive Relations
Branimir Lambov. Complexity and Intensionality in a Type-1 Framework
for Computable Analysis
Vasco Brattka and Matthias Schröder. Computing with Sequences, Weak
Topologies and the Axiom of Choice
Hubie Chen and Victor Dalmau. From Pebble Games to Tractability: An
Ambidextrous Consistency Algorithm for Quantified Constraint
Satisfaction
Witold Charatonik, Lilia Georgieva and Patrick Maier. Bounded Model
Checking of Pointer Programs
Ashish Tiwari. An Algebraic Approach for the Unsatisfiability of Nonlinear
Constraints
Carsten Schuermann and Jatin Shah. Identifying polynomial-time
recursive functions
Michael Benedikt and Luc Segoufin. Towards a Characterization of
Order-Invariant Queries over Tame Structures
Julian Bradfield and Stephan Kreutzer. The Complexity of
Independence-Friendly Fixpoint Logic
Pierre-Louis Curien and Claudia Faggian. L-nets, Strategies and Proof-nets
Esfandiar Haghverdi and Philip Scott. Towards A Typed Geometry of
Interaction
Jean-Marc Andreoli, Paul Ruet and Gabriele Pulcini. Permutative Logic
Bruno Barras and Benjamin Gregoire. On the role of type decorations in
the Calculus of Inductive Constructions
|
|
