The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
1988 (conf/lics/LICS3)

  1. 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]
  2. Kevin J. Compton, Claude Laflamme
    An Algebra and a Logic for NC¹ [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:12-21 [Conf]
  3. Michael L. Tiomkin
    Proving unprovability [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:22-26 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Paola Giannini, Simona Ronchi Della Rocca
    Characterization of typings in polymorphic type discipline [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:61-70 [Conf]
  8. 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]
  9. Val Tannen
    Combining Algebra and Higher-Order Types [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:82-90 [Conf]
  10. 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]
  11. Nachum Dershowitz, Mitsuhiro Okada
    Proof-Theoretic Techniques for Term Rewriting Theory [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:104-111 [Conf]
  12. 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]
  13. 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]
  14. Mitchell Wand
    Corrigendum: Complete Type Inference for Simple Objects [Citation Graph (1, 0)][DBLP]
    LICS, 1988, pp:132- [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. Martín Abadi, Leslie Lamport
    The Existence of Refinement Mappings [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:165-175 [Conf]
  19. Mads Dam
    Relevance Logic and Concurrent Composition [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:178-185 [Conf]
  20. D. J. Walker
    Bisimulations and Divergence [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:186-192 [Conf]
  21. Rance Cleaveland, Matthew Hennessy
    Priorities in Process Algebras [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:193-202 [Conf]
  22. Kim Guldstrand Larsen, Bent Thomsen
    A Modal Process Logic [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:203-210 [Conf]
  23. Sergei G. Vorobyov
    On the Arithmetic Inexpressiveness of Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:212-217 [Conf]
  24. 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]
  25. Leo Bachmair
    Proof by Consistency in Equational Theories [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:228-233 [Conf]
  26. 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]
  27. Thierry Coquand
    Categories of Embeddings [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:256-263 [Conf]
  28. Thomas Ehrhard
    A Categorical Semantics of Constructions [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:264-273 [Conf]
  29. 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]
  30. 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]
  31. Robert Cartwright, Alan J. Demers
    The Topology of Program Termination [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:296-308 [Conf]
  32. Carl A. Gunter, Achim Jung
    Coherence and Consistency in Domains (Extended Outline) [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:309-317 [Conf]
  33. 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]
  34. Marianne Baudinet
    Proving Termination Properties of Prolog Programs: A Semantic Approach [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:336-347 [Conf]
  35. 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]
  36. Robert L. Constable, Scott F. Smith
    Computational Foundations of Basic Recursive Function Theory [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:360-371 [Conf]
  37. Timothy Griffin
    Notational definition-a formal account [Citation Graph (1, 0)][DBLP]
    LICS, 1988, pp:372-383 [Conf]
  38. 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]
  39. 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]
  40. Damian Niwinski
    Fixed Points vs. Infinite Generation [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:402-409 [Conf]
  41. Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo
    A Logic for Reasoning about Probabilities [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:410-421 [Conf]
  42. 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]
  43. Michal Grabowski, Hardi Hungar
    On the Existence of Effective Hoare Logics [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:428-435 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002