Conferences in DBLP
Ofer Arieli , Arnon Avron Four-Valued Diagnoses for Stratified Knowledge-Bases. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Baaz , Alexander Leitsch Fast Cut-Elimination by Projection. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Barthe , Paul-André Melliès On the Subject Reduction Property for Algebraic Type Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Gian Luca Cattani , Glynn Winskel Presheaf Models for Concurrency. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Danos , Marco Pedicini , Laurent Regnier Directed Virtual Reductions. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Dziembowski Bounded-Variable Fixpoint Queries are PSPACE-complete. [Citation Graph (0, 0)][DBLP ] Conf ] Marko C. J. D. van Eekelen , Sjaak Smetsers , Marinus J. Plasmeijer Graph Rewriting Semantics for Functional Programming Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Marcelo P. Fiore , Gordon D. Plotkin An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Alfons Geser , Aart Middeldorp , Enno Ohlebusch , Hans Zantema Relative Undecidability in Term Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Herman Geuvers Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Neil Ghani Eta-Expansions in Fomega . [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Goré Cut-free Display Calculi for Relation Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Henrik Imhof Computational Aspects of Arity Hierarchies. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Ingólfsdóttir Weak Semantics Based on Lighted Button Pressing Experiments. [Citation Graph (0, 0)][DBLP ] Conf ] Dexter Kozen , Frederick Smith Kleene Algebra with Tests: Completeness and Decidability. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kreidler , Detlef Seese Monadic NP and Built-in Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Zhaohui Luo Coercive Subtyping in Type Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Sophie Malecki Proofs in System Fomega Can Be Done in System Fomega 1 . [Citation Graph (0, 0)][DBLP ] Conf ] Anders Malmström Optimization Problems with Approximation Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Matzinger Computational Representations of Herbrand Models Using Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Merkle Exact Pairs for Abstract Bounded Reducibilities. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Otto The Logic of Explicitly Presentation-Invariant Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Philippou , David Walker Social Confluence in Client-Server Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Roversi A Type-Free Resource-Aware Lambda-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Anton Setzer Inductive Definitions with Decidable Atomic Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Robert F. Stärk Call-by-Value, Call-by-Name and the Logic of Values. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Statman On Cartesian Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] A. D. Yashin New Intuitionistic Logical Constants: Undecidability of the Conservativsness Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 