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