|
|
-
Andreas
Abel.
Type Structures and Normalization by Evaluation for System
F-omega
-
Beniamino Accattoli and Stefano Guerrini.
Jumping Boxes. Representing lambda-calculus boxes by jumps
-
Isolde Adler
and Mark Weyer.
Tree-width for first order formulae
-
Rajeev Alur, Pavol Cerny and Scott
Weinstein.
Algorithmic Analysis of Array-Accessing
Programs
-
Albert
Atserias and Mark Weyer.
Decidable Relationships between
Consistency Notions for Constraint Satisfaction Problems
-
Vince
Barany, Lukasz
Kaiser and Alexander
Rabinovich.
Cardinality quantifiers in MLO over trees
-
Ulrich
Berger.
From coinductive proofs to exact real arithmetic
-
Frederic Blanqui and Cody
Roux.
On the relation between size-based termination and
semantic labelling
-
Agata
Ciabattoni, Lutz Strassburger
and Kazushige
Terui.
Expanding the realm of systematic proof theory
-
Corina
Cirstea, Clemens Kupke and Dirk
Pattinson.
EXPTIME Tableaux for Coalgebraic mu-calculi
-
Mariangiola
Dezani, Paola Giannini and Simona Ronchi.
Intersection, Universally Quantified and Reference Types
-
Jacques
Duparc, Filip Murlak and
Alessandro Facchini.
Linear Game Automata: Decidable Hierarchy
Problems for Stripped-Down Alternating Tree Automata
-
Jeff Egger, Rasmus Mogelberg and
Alex
Simpson.
Enriching an Effect Calculus with Linear Types
-
Joerg
Endrullis, Herman Geuvers and Hans
Zantema.
Degrees of Undecidability in Term Rewriting
-
Amelie Gheerbrant and Balder ten
Cate.
Craig Interpolation on linear orders
-
Heng Guo, Hanpin Wang and
Zhongyuan Xu.
On Model Checking Boolean BI
-
Martin
Hofmann and Dulma Rodriguez.
Efficient Type-Checking for Amortised Heap-Space Analysis
-
Matthias Horbach and Christoph
Weidenbach.
Deciding the Inductive Validity of
∀∃* Queries
-
Stephan
Kreutzer.
On the parameterized intractability of monadic
second-order logic
-
Dietrich Kuske
and Markus
Lohrey.
Automatic structures of bounded degree revisited
-
James Laird.
Nondeterminism and Observable Sequentiality
-
Angelo
Montanari, Gabriele Puppis and Pietro
Sala.
A Decidable Spatial Logic with Cone-shaped Cardinal
Directions
-
Guillaume Munch
Maccagnoni.
Focalization and Classical Realizability
-
Romain
Péchoux and Marco Gaboardi.
Upper Bounds on Streams I/O using Semantics Interpretations
-
Alexander
Rabinovich.
Decidable Extensions of Church's Problem
-
Luigi
Santocanale and Robin
Cockett.
On the word problem for SP-categories, and the properties of two-way communication
-
Jan
Schwinghammer, Lars Birkedal, Bernhard
Reus and Hongseok Yang.
Nested Hoare Triples and Frame Rules for Higher-order Store
-
Eijiro Sumii.
A Complete Characterization of Observational Equivalence in Polymorphic lambda-Calculus with General References
-
Makoto
Tatsuta.
Non-Commutative First-Order Sequent Calculus
-
Anthony
Widjaja To.
Model checking FO(R) over one-counter processes and beyond
-
Paolo Tranquilli.
Confluence of Differential Nets with Promotion
-
Michael Ummels and
Dominik Wojtczak.
Decision Problems for Nash Equilibria in Stochastic Games
-
Volker
Weber.
On the Complexity of Branching-Time Logics
-
Glynn Winskel
and David
Turner.
Nominal Domain Theory for Concurrency
|
|
|
