Conferences in DBLP
Phokion G. Kolaitis , Moshe Y. Vardi 0-1 Laws and Decision Problems for Fragments of Second-Order Logic [Citation Graph (3, 0)][DBLP ] LICS, 1988, pp:2-11 [Conf ] Kevin J. Compton , Claude Laflamme An Algebra and a Logic for NC¹ [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:12-21 [Conf ] Michael L. Tiomkin Proving unprovability [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:22-26 [Conf ] C. A. R. Hoare , Michael J. C. Gordon Partial Correctness of C-MOS Switching Circuits: An Exercise in Applied Logic [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:28-36 [Conf ] Kim B. Bruce , Giuseppe Longo A Modest Model of Records, Inheritance and Bounded Quantification [Citation Graph (1, 0)][DBLP ] LICS, 1988, pp:38-50 [Conf ] Roberto M. Amadio A fixed point extension of the second order lambda-calculus: observable equivalences and models [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:51-60 [Conf ] Paola Giannini , Simona Ronchi Della Rocca Characterization of typings in polymorphic type discipline [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:61-70 [Conf ] A. J. Kfoury , Jerzy Tiuryn , Pawel Urzyczyn On the Computational Power of Universally Polymorphic Recursion [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:72-81 [Conf ] Val Tannen Combining Algebra and Higher-Order Types [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:82-90 [Conf ] Corrado Böhm , Adolfo Piperno Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:91-101 [Conf ] Nachum Dershowitz , Mitsuhiro Okada Proof-Theoretic Techniques for Term Rewriting Theory [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:104-111 [Conf ] Gabriel M. Kuper , Ken McAloon , Krishna V. Palem , Kenneth J. Perry Efficient Parallel Algorithms for Anti-Unification and Relative Complement [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:112-120 [Conf ] Alexandre Boudet , Jean-Pierre Jouannaud , Manfred Schmidt-Schauß Unification in Free Extensions of Boolean Rings and Abelian Groups [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:121-130 [Conf ] Mitchell Wand Corrigendum: Complete Type Inference for Simple Objects [Citation Graph (1, 0)][DBLP ] LICS, 1988, pp:132- [Conf ] Pierpaolo Degano , Rocco De Nicola , Ugo Montanari On the Consistency of ``Truly Concurrent'' Operational and Denotational Semantics (Extended Abstract) [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:133-141 [Conf ] Glynn Winskel A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract) [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:142-154 [Conf ] José Meseguer , Ugo Montanari Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:155-164 [Conf ] Martín Abadi , Leslie Lamport The Existence of Refinement Mappings [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:165-175 [Conf ] Mads Dam Relevance Logic and Concurrent Composition [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:178-185 [Conf ] D. J. Walker Bisimulations and Divergence [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:186-192 [Conf ] Rance Cleaveland , Matthew Hennessy Priorities in Process Algebras [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:193-202 [Conf ] Kim Guldstrand Larsen , Bent Thomsen A Modal Process Logic [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:203-210 [Conf ] Sergei G. Vorobyov On the Arithmetic Inexpressiveness of Term Rewriting Systems [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:212-217 [Conf ] Jean H. Gallier , Wayne Snyder , Paliath Narendran , David A. Plaisted Rigid E-Unification is NP-Complete [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:218-227 [Conf ] Leo Bachmair Proof by Consistency in Equational Theories [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:228-233 [Conf ] Albert R. Meyer Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:236-253 [Conf ] Thierry Coquand Categories of Embeddings [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:256-263 [Conf ] Thomas Ehrhard A Categorical Semantics of Constructions [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:264-273 [Conf ] Peter J. Freyd , Jean-Yves Girard , Andre Scedrov , Philip J. Scott Semantic Parametricity in Polymorphic Lambda Calculus [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:274-279 [Conf ] Bard Bloom Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report) [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:282-295 [Conf ] Robert Cartwright , Alan J. Demers The Topology of Program Termination [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:296-308 [Conf ] Carl A. Gunter , Achim Jung Coherence and Consistency in Domains (Extended Outline) [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:309-317 [Conf ] Rob Gerth , Michael Codish , Yossi Lichtenstein , Ehud Y. Shapiro Fully Abstract Denotational Semantics for Flat Concurrent Prolog [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:320-335 [Conf ] Marianne Baudinet Proving Termination Properties of Prolog Programs: A Semantic Approach [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:336-347 [Conf ] Michael J. Maher Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees [Citation Graph (2, 0)][DBLP ] LICS, 1988, pp:348-357 [Conf ] Robert L. Constable , Scott F. Smith Computational Foundations of Basic Recursive Function Theory [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:360-371 [Conf ] Timothy Griffin Notational definition-a formal account [Citation Graph (1, 0)][DBLP ] LICS, 1988, pp:372-383 [Conf ] Anne Salvesen , Jan M. Smith The Strength of the Subset Type in Martin-Löf's Type Theory [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:384-391 [Conf ] Paul F. Mendler , Peter Aczel The notion of a Framework and a framework for LTC [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:392-399 [Conf ] Damian Niwinski Fixed Points vs. Infinite Generation [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:402-409 [Conf ] Ronald Fagin , Joseph Y. Halpern , Nimrod Megiddo A Logic for Reasoning about Probabilities [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:410-421 [Conf ] David E. Muller , Ahmed Saoudi , Paul E. Schupp Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:422-427 [Conf ] Michal Grabowski , Hardi Hungar On the Existence of Effective Hoare Logics [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:428-435 [Conf ]