The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
1989 (conf/lics/LICS4)

  1. Dana S. Scott
    Domains and Logics (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:4-5 [Conf]
  2. Andrew M. Pitts
    Non-trivial Power Types Can't Be Subtypes of Polymorphic Types [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:6-13 [Conf]
  3. Eugenio Moggi
    Computational Lambda-Calculus and Monads [Citation Graph (2, 0)][DBLP]
    LICS, 1989, pp:14-23 [Conf]
  4. Stavros S. Cosmadakis
    Computing with Recursive Types (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:24-38 [Conf]
  5. Daniel Leivant
    Stratified Polymorphism (Extended Summary) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:39-47 [Conf]
  6. Haim Gaifman, Ehud Y. Shapiro
    Proof Theory and Semantics of Logic Programs [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:50-62 [Conf]
  7. Melvin Fitting
    Negation As Refutation [Citation Graph (1, 0)][DBLP]
    LICS, 1989, pp:63-70 [Conf]
  8. Serge Abiteboul, Victor Vianu
    Fixpoint Extensions of First-Order Logic and Datalog-Like Languages [Citation Graph (12, 0)][DBLP]
    LICS, 1989, pp:71-79 [Conf]
  9. Soumitra Bose, Edmund M. Clarke, David E. Long, Spiro Michaylov
    PARTHENON: A Parallel Theorem Prover for Non-Horn Clauses [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:80-89 [Conf]
  10. Mitchell Wand
    Type Inference for Record Concatenation and Multiple Inheritance [Citation Graph (1, 0)][DBLP]
    LICS, 1989, pp:92-97 [Conf]
  11. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:98-105 [Conf]
  12. Edmund Robinson
    How Complete is PER? [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:106-111 [Conf]
  13. Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov
    Inheritance and Explicit Coercion (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    LICS, 1989, pp:112-129 [Conf]
  14. Martin Davis
    Emil Post's Contributions to Computer Science [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:134-136 [Conf]
  15. Luca Aceto, Matthew Hennessy
    Towards Action-Refinement in Process Algebras [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:138-145 [Conf]
  16. Jay L. Gischer
    A Small Universal Model for System Executions [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:146-153 [Conf]
  17. Yiannis N. Moschovakis
    A Game-Theoretic Modeling of Concurrency [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:154-163 [Conf]
  18. Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    Nets and Data Flow Interpreters [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:164-174 [Conf]
  19. Pierpaolo Degano, José Meseguer, Ugo Montanari
    Axiomatizing Net Computations and Processes [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:175-185 [Conf]
  20. C. Jones, Gordon D. Plotkin
    A Probabilistic Powerdomain of Evaluations [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:186-195 [Conf]
  21. Douglas J. Howe
    Equality In Lazy Computation Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:198-203 [Conf]
  22. Roel C. de Vrijer
    Extending the Lambda Calculus with Surjective Pairing is Conservative [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:204-215 [Conf]
  23. Martín Abadi, Benjamin C. Pierce, Gordon D. Plotkin
    Faithful Ideal Models for Recursive Polymorphic Types [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:216-225 [Conf]
  24. Robert Harper, Donald Sannella, Andrzej Tarlecki
    Structure and Representation in LF [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:226-237 [Conf]
  25. Vladimir Lifschitz
    The Mathematics of Nonmonotonic Reasoning (Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:242- [Conf]
  26. Moshe Y. Vardi
    On the Complexity of Epistemic Reasoning [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:243-252 [Conf]
  27. Michael Kifer, Eliezer L. Lozinskii
    RI: A Logic for Reasoning with Inconsistency [Citation Graph (6, 0)][DBLP]
    LICS, 1989, pp:253-262 [Conf]
  28. Michael W. Mislove, Lawrence S. Moss, Frank J. Oles
    Non-Well-Founded Sets Obtained from Ideal Fixed Points [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:263-272 [Conf]
  29. R. T. P. Fernando
    On Substitutional Recursion Over Non-Well-Founded Sets [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:273-282 [Conf]
  30. Ian A. Mason, Carolyn L. Talcott
    Axiomatizing Operational Equivalence in the Presence of Side Effects [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:284-293 [Conf]
  31. Radha Jagadeesan, Prakash Panangaden, Keshav Pingali
    A Fully Abstract Semantics for a Functional Language with Logic Variables [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:294-303 [Conf]
  32. Peter D. Mosses
    Unified Algebras and Institutions [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:304-312 [Conf]
  33. Frank Pfenning
    Elf: A Language for Logic Definition and Verified Metaprogramming [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:313-322 [Conf]
  34. Alexei P. Stolboushkin
    Some Complexity Bounds for Dynamic Logics [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:324-332 [Conf]
  35. E. Allen Emerson, Charanjit S. Jutla
    On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:333-342 [Conf]
  36. Robert S. Lubarsky
    mu-Definable Sets of Integers [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:343-352 [Conf]
  37. Edmund M. Clarke, David E. Long, Kenneth L. McMillan
    Compositional Model Checking [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:353-362 [Conf]
  38. Andreas Goerdt
    Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:364-374 [Conf]
  39. Anil Nerode, Jeffrey B. Remmel, Andre Scedrov
    Polynomially Grade Logic I: A Graded Version of System T [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:375-385 [Conf]
  40. Zhaohui Luo
    ECC, an Extended Calculus of Constructions [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:386-395 [Conf]
  41. Aart Middeldorp
    A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:396-401 [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