Conferences in DBLP
Rod M. Burstall Terms, Proofs, and Refinement (Extended abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Gurevich , Neil Immerman , Saharon Shelah McColm's Conjecture [Citation Graph (0, 0)][DBLP ] Conf ] Anuj Dawar , Lauri Hella The Expressive Power of Finitely Many Generalized Quantifiers [Citation Graph (0, 0)][DBLP ] Conf ] Martin Otto Generalized Quantifiers for Simple Properties [Citation Graph (0, 0)][DBLP ] Conf ] Lauri Hella , Phokion G. Kolaitis , Kerkko Luosto How to Define a Linear Order on Finite Models [Citation Graph (1, 0)][DBLP ] Conf ] Rajeev Alur , Thomas A. Henzinger Finitary Fairness [Citation Graph (0, 0)][DBLP ] Conf ] Peter Sewell Bisimulation is Not Finitely (First Order) Equationally Axiomatisable [Citation Graph (0, 0)][DBLP ] Conf ] Vijay A. Saraswat , Radha Jagadeesan , Vineet Gupta Foundations of Timed Concurrent Constraint Programming [Citation Graph (0, 0)][DBLP ] Conf ] Alan Jeffrey A Fully Abstract Semantics for Concurrent Graph Reduction [Citation Graph (0, 0)][DBLP ] Conf ] Marcelo P. Fiore , Gordon D. Plotkin An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC [Citation Graph (0, 0)][DBLP ] Conf ] Loïc Colson , Thomas Ehrhard On Strong Stability and Higher-Order Sequentiality [Citation Graph (0, 0)][DBLP ] Conf ] Michael Huth , Achim Jung , Klaus Keimel Linear Types, Approximation, and Topology [Citation Graph (0, 0)][DBLP ] Conf ] Abbas Edalat Domain Theory and Integration [Citation Graph (0, 0)][DBLP ] Conf ] Edmund M. Clarke Automatic Verification of Finite-State Concurrent Systems [Citation Graph (0, 0)][DBLP ] Conf ] Witold Charatonik , Leszek Pacholski Negative Set Constraints with Equality [Citation Graph (0, 0)][DBLP ] Conf ] Kjartan Stefánsson Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete [Citation Graph (0, 0)][DBLP ] Conf ] Henrik Reif Andersen , Colin Stirling , Glynn Winskel A Compositional Proof System for the Modal mu-Calculus [Citation Graph (0, 0)][DBLP ] Conf ] Shipei Zhang , Oleg Sokolsky , Scott A. Smolka On the Parallel Complexity of Model Checking in the Modal Mu-Calculus [Citation Graph (0, 0)][DBLP ] Conf ] Edith Hemaspaandra Complexity Transfer for Modal Logic (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] J. B. Wells Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and Undecidable [Citation Graph (0, 0)][DBLP ] Conf ] Jens Palsberg Efficient Inference of Object Types [Citation Graph (0, 0)][DBLP ] Conf ] Adolfo Piperno , Simona Ronchi Della Rocca Type Inference and Extensionality [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hofmann , Thomas Streicher The Groupoid Model Refutes Uniqueness of Identity Proofs [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Baaz , Christian G. Fermüller , Alexander Leitsch A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Toniann Pitassi , Alasdair Urquhart Upper and Lower Bounds for Tree-Like Cutting Planes Proofs [Citation Graph (0, 0)][DBLP ] Conf ] Serge Abiteboul , Christos H. Papadimitriou , Victor Vianu The Power of Reflective Relational Machines [Citation Graph (5, 0)][DBLP ] Conf ] J. Antonio Medina , Neil Immerman A Syntactic Characterization of NP-Completeness [Citation Graph (0, 0)][DBLP ] Conf ] Robert F. Stärk The Declarative Semantics of the Prolog Selection Rule [Citation Graph (0, 0)][DBLP ] Conf ] Antonio Brogi , Franco Turini Semantics of Meta-Logic in an Algebra of Programs [Citation Graph (0, 0)][DBLP ] Conf ] Dale Miller A Multiple-Conclusion Meta-Logic [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Lincoln , Natarajan Shankar Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi [Citation Graph (0, 0)][DBLP ] Conf ] Ralph Loader Linear Logic, Totality and Full Completeness [Citation Graph (0, 0)][DBLP ] Conf ] Pawel Urzyczyn The Emptiness Problem for Intersection Types [Citation Graph (0, 0)][DBLP ] Conf ] Gordon D. Plotkin , Martín Abadi , Luca Cardelli Subtyping and Parametricity [Citation Graph (0, 0)][DBLP ] Conf ] Herman Geuvers , Benjamin Werner On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study [Citation Graph (0, 0)][DBLP ] Conf ] Martín Abadi , Luca Cardelli A Semantics of Object Types [Citation Graph (0, 0)][DBLP ] Conf ] Uday S. Reddy Passivity and Independence [Citation Graph (0, 0)][DBLP ] Conf ] Eugenio Moggi A General Semantics for Evaluation Logic [Citation Graph (0, 0)][DBLP ] Conf ] E. P. Robinson , Giuseppe Rosolini Reflexive Graphs and Parametric Polymorphism [Citation Graph (0, 0)][DBLP ] Conf ] Carolyn Brown , Graham Hutton Categories, Allegories and Circuit Design [Citation Graph (0, 0)][DBLP ] Conf ] Leo Bachmair , Harald Ganzinger Rewrite Techniques for Transitive Relations [Citation Graph (0, 0)][DBLP ] Conf ] Claude Marché Normalised Rewriting and Normalised Completion [Citation Graph (0, 0)][DBLP ] Conf ] Franco Barbanera , Maribel Fernández , Herman Geuvers Modularity of Strong Normalization and Confluence in the algebraic-lambda-Cube [Citation Graph (0, 0)][DBLP ] Conf ] Zena M. Ariola , Jan Willem Klop Cyclic Lambda Graph Rewriting [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Asperti , Vincent Danos , Cosimo Laneve , Laurent Regnier Paths in the lambda-calculus [Citation Graph (0, 0)][DBLP ] Conf ] P. S. Thiagarajan A Trace Based Extension of Linear Time Temporal Logic [Citation Graph (0, 0)][DBLP ] Conf ] Ron van der Meyden Axioms for Knowledge and Time in Distributed Systems with Perfect Recall [Citation Graph (0, 0)][DBLP ] Conf ] Edward Y. Chang , Zohar Manna , Amir Pnueli Compositional Verification of Real-Time Systems [Citation Graph (0, 0)][DBLP ] Conf ] Ofer Arieli , Arnon Avron Logical Bilattices and Inconsistent Data [Citation Graph (0, 0)][DBLP ] Conf ] Shai Ben-David , Rachel Ben-Eliyahu a modal logic for subjective default reasoning [Citation Graph (0, 0)][DBLP ] Conf ] Mati Pentus Language Completeness of the Lambek Calculus [Citation Graph (0, 0)][DBLP ] Conf ] Jean Goubault Rigid E-Unifiability is DEXPTIME-Complete [Citation Graph (0, 0)][DBLP ] Conf ] Christian Prehofer Higher-Order Narrowing [Citation Graph (0, 0)][DBLP ] Conf ] 