Proceedings of the Fourth Annual Symposium on Logic in Computer Science
LICS, 1989.

@proceedings{LICS-1989,
	address       = "Pacific Grove, California, USA",
	isbn          = "0-8186-1954-6",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the Fourth Annual Symposium on Logic in Computer Science}",
	year          = 1989,
}

Contents (40 items)

7 ×#logic
4 ×#recursion
3 ×#complexity
3 ×#named
3 ×#on the
3 ×#polymorphism
3 ×#reasoning
3 ×#set
2 ×#axiom
2 ×#fixpoint

LICS-1989-Scott #logic

Domains and Logics (DSS), pp. 4–5.

LICS-1989-Pitts #polymorphism #type system

Non-trivial Power Types Can’t Be Subtypes of Polymorphic Types (AMP), pp. 6–13.

LICS-1989-Moggi #monad #λ-calculus

Computational λ-Calculus and Monads (EM), pp. 14–23.

LICS-1989-Cosmadakis #recursion

Computing with Recursive Types (SSC), pp. 24–38.

LICS-1989-Leivant #morphism #polymorphism

Stratified Polymorphism (DL), pp. 39–47.

LICS-1989-GaifmanS #logic programming #proving #semantics #source code

Proof Theory and Semantics of Logic Programs (HG, EYS), pp. 50–62.

LICS-1989-Fitting

Negation As Refutation (MF), pp. 63–70.

LICS-1989-AbiteboulV #first-order #fixpoint #logic

Fixpoint Extensions of First-Order Logic and Datalog-Like Languages (SA, VV), pp. 71–79.

LICS-1989-BoseCLM #horn clause #named #parallel #proving #theorem proving

PARTHENON: A Parallel Theorem Prover for Non-Horn Clauses (SB, EMC, DEL, SM), pp. 80–89.

LICS-1989-Wand #inheritance #multi #type inference

Type Inference for Record Concatenation and Multiple Inheritance (MW), pp. 92–97.

LICS-1989-KfouryTU #problem #unification

Computational Consequences and Partial Solutions of a Generalized Unification Problem (AJK, JT, PU), pp. 98–105.

LICS-1989-Robinson #how #question

How Complete is PER? (ER), pp. 106–111.

LICS-1989-Breazu-TannenCGS #inheritance

Inheritance and Explicit Coercion (VT, TC, CAG, AS), pp. 112–129.

LICS-1989-Davis

Emil Post’s Contributions to Computer Science (MD), pp. 134–136.

LICS-1989-AcetoH #algebra #process #towards

Towards Action-Refinement in Process Algebras (LA, MH), pp. 138–145.

LICS-1989-Gischer

A Small Universal Model for System Executions (JLG), pp. 146–153.

LICS-1989-Moschovakis #concurrent #formal method #game studies #modelling

A Game-Theoretic Modeling of Concurrency (YNM), pp. 154–163.

LICS-1989-RabinovichT #data flow

Nets and Data Flow Interpreters (AMR, BAT), pp. 164–174.

LICS-1989-DeganoMM #axiom #process

Axiomatizing Net Computations and Processes (PD, JM, UM), pp. 175–185.

LICS-1989-JonesP #probability

A Probabilistic Powerdomain of Evaluations (CJ, GDP), pp. 186–195.

LICS-1989-Howe #lazy evaluation #similarity

Equality In Lazy Computation Systems (DJH), pp. 198–203.

LICS-1989-Vrijer #λ-calculus

Extending the λ Calculus with Surjective Pairing is Conservative (RCdV), pp. 204–215.

LICS-1989-AbadiPP #modelling #polymorphism #recursion

Faithful Ideal Models for Recursive Polymorphic Types (MA, BCP, GDP), pp. 216–225.

LICS-1989-HarperST #representation

Structure and Representation in LF (RH, DS, AT), pp. 226–237.

LICS-1989-Lifschitz #reasoning

The Mathematics of Nonmonotonic Reasoning (VL), p. 242.

LICS-1989-Vardi #complexity #on the #reasoning

On the Complexity of Epistemic Reasoning (MYV), pp. 243–252.

LICS-1989-KiferL #consistency #logic #named #nondeterminism #reasoning

RI: A Logic for Reasoning with Inconsistency (MK, ELL), pp. 253–262.

LICS-1989-MisloveMO #fixpoint #set

Non-Well-Founded Sets Obtained from Ideal Fixed Points (MWM, LSM, FJO), pp. 263–272.

LICS-1989-Fernando #on the #recursion #set

On Substitutional Recursion Over Non-Well-Founded Sets (RTPF), pp. 273–282.

LICS-1989-MasonT #axiom #equivalence

Axiomatizing Operational Equivalence in the Presence of Side Effects (IAM, CLT), pp. 284–293.

LICS-1989-JagadeesanPP #functional #logic #semantics

A Fully Abstract Semantics for a Functional Language with Logic Variables (RJ, PP, KP), pp. 294–303.

LICS-1989-Pfenning #logic #metaprogramming #named

Elf: A Language for Logic Definition and Verified Metaprogramming (FP), pp. 313–322.

LICS-1989-Stolboushkin #bound #complexity #logic

Some Complexity Bounds for Dynamic Logics (APS), pp. 324–332.

LICS-1989-EmersonJ #automaton #on the

On Simultaneously Determinizing and Complementing ω-Automata (EAE, CSJ), pp. 333–342.

LICS-1989-Lubarsky #integer #set

μ-Definable Sets of Integers (RSL), pp. 343–352.

LICS-1989-ClarkeLM #composition #model checking

Compositional Model Checking (EMC, DEL, KLM), pp. 353–362.

LICS-1989-Goerdt #complexity #recursion

Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions (AG), pp. 364–374.

LICS-1989-NerodeRS #logic

Polynomially Grade Logic I: A Graded Version of System T (AN, JBR, AS), pp. 375–385.

LICS-1989-Luo #calculus

ECC, an Extended Calculus of Constructions (ZL), pp. 386–395.

LICS-1989-Middeldorp #term rewriting #termination

A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems (AM), pp. 396–401.