Conferences in DBLP
Franz Baader Combination of Compatible Reduction Orderings that are Total on Ground Terms. [Citation Graph (0, 0)][DBLP ] Conf ] Adel Bouhoula , Jean-Pierre Jouannaud Automata-Driven Automated Induction. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Comon , Florent Jacquemard Ground Reducibility is EXPTIME-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Di Cosmo , Delia Kesner Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Max I. Kanovich , Takayasu Ito Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] James Laird Full Abstraction for Functional Languages with Control. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Baillot , Vincent Danos , Thomas Ehrhard , Laurent Regnier Believe it or not, AJM's Games Model is a Model of Classical Linear Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Dominic J. D. Hughes Games and Definability for System F. [Citation Graph (0, 0)][DBLP ] Conf ] Henrik Reif Andersen , Henrik Hulgaard Boolean Expression Diagrams (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Dziembowski , Marcin Jurdzinski , Igor Walukiewicz How Much Memory is Needed to Win Infinite Games? [Citation Graph (0, 0)][DBLP ] Conf ] Michael Huth , Marta Z. Kwiatkowska Quantitative Analysis and Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Naoki Kobayashi A Partially Deadlock-Free Typed Process Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Julian Rathke Unique Fixpoint Induction for Value-Passing Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Richard Blute , Josee Desharnais , Abbas Edalat , Prakash Panangaden Bisimulation for Labelled Markov Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Eugene Asarin , Paul Caspi , Oded Maler A Kleene Theorem for Timed Automata. [Citation Graph (0, 0)][DBLP ] Conf ] David Janin Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices. [Citation Graph (0, 0)][DBLP ] Conf ] P. S. Thiagarajan , Igor Walukiewicz An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP ] Conf ] Dexter Kozen On the Complexity of Reasoning in Kleene Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Libkin On the Forms of Locality over Finite Models. [Citation Graph (2, 0)][DBLP ] Conf ] Martin Grohe Large Finite Structures with Few Lk -Types. [Citation Graph (1, 0)][DBLP ] Conf ] Kousha Etessami , Moshe Y. Vardi , Thomas Wilke First-Order Logic with Two Variables and Unary Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Oliver Matz , Wolfgang Thomas The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite. [Citation Graph (0, 0)][DBLP ] Conf ] Peter John Potts , Abbas Edalat , Martín Hötzel Escardó Semantics of Exact Real Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Jon G. Riecke , Anders Sandholm A Relational Account of Call-by-Value Sequentiality. [Citation Graph (0, 0)][DBLP ] Conf ] Marcelo P. Fiore , Gordon D. Plotkin , A. John Power Complete Cuboidal Sets in Axiomatic Domain Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Turi , Gordon D. Plotkin Towards a Mathematical Operational Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei G. Vorobyov The "Hardest" Natural Decidable Theory. [Citation Graph (1, 0)][DBLP ] Conf ] Erich Grädel , Martin Otto , Eric Rosen Two-Variable Logic with Counting is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Pacholski , Wieslaw Szwast , Lidia Tendera Complexity of Two-Variable Logic with Counting. [Citation Graph (0, 0)][DBLP ] Conf ] Guo-Qiang Zhang , William C. Rounds Complexity of Power Default Reasoning. [Citation Graph (0, 0)][DBLP ] Conf ] Nevin Heintze , David A. McAllester On the Cubic Bottleneck in Subtyping and Flow Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Fritz Henglein , Jakob Rehof The Complexity of Subtype Entailment for Simple Types. [Citation Graph (0, 0)][DBLP ] Conf ] Witold Charatonik , Andreas Podelski Set Constraints with Intersection. [Citation Graph (0, 0)][DBLP ] Conf ] Martín Hötzel Escardó , Thomas Streicher Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hofmann , Thomas Streicher Continuation Models are Universal for Lambda-Mu-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Mariangiola Dezani-Ciancaglini , Jerzy Tiuryn , Pawel Urzyczyn Discrimination by Parallel Observers. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Goubault-Larrecq Ramified Higher-Order Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Iliano Cervesato , Frank Pfenning Linear Higher-Order Pre-Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Raymond McDowell , Dale Miller A Logic for Reasoning with Higher-Order Abstract Syntax. [Citation Graph (0, 0)][DBLP ] Conf ] 