Proceedings of the Ninth Annual Symposium on Logic in Computer Science
LICS, 1994.

@proceedings{LICS-1994,
	address       = "Paris, France",
	isbn          = "0-8186-6310-3",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the Ninth Annual Symposium on Logic in Computer Science}",
	year          = 1994,
}

Contents (53 items)

9 ×#logic
6 ×#proving
5 ×#linear
5 ×#semantics
4 ×#calculus
3 ×#axiom
3 ×#composition
3 ×#concurrent
3 ×#constraints
3 ×#higher-order

LICS-1994-Burstall #proving #refinement

Terms, Proofs, and Refinement (RMB), pp. 2–7.

LICS-1994-GurevichIS

McColm’s Conjecture (YG, NI, SS), pp. 10–19.

LICS-1994-DawarH #power of #quantifier

The Expressive Power of Finitely Many Generalized Quantifiers (AD, LH), pp. 20–29.

LICS-1994-Otto #quantifier

Generalized Quantifiers for Simple Properties (MO), pp. 30–39.

LICS-1994-HellaKL #finite #how #linear #modelling #order

How to Define a Linear Order on Finite Models (LH, PGK, KL), pp. 40–49.

LICS-1994-AlurH

Finitary Fairness (RA, TAH), pp. 52–61.

LICS-1994-Sewell #axiom #bisimulation #equation #first-order

Bisimulation is Not Finitely (First Order) Equationally Axiomatisable (PS), pp. 62–70.

LICS-1994-SaraswatJG #concurrent #constraints #programming

Foundations of Timed Concurrent Constraint Programming (VAS, RJ, VG), pp. 71–80.

LICS-1994-Jeffrey #concurrent #graph #reduction #semantics

A Fully Abstract Semantics for Concurrent Graph Reduction (AJ), pp. 82–91.

LICS-1994-FioreP #axiom #formal method #modelling

An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC (MPF, GDP), pp. 92–102.

LICS-1994-ColsonE #higher-order #on the

On Strong Stability and Higher-Order Sequentiality (LC, TE), pp. 103–108.

LICS-1994-HuthJK #approximate #linear

Linear Types, Approximation, and Topology (MH, AJ, KK), pp. 110–114.

LICS-1994-Edalat #integration

Domain Theory and Integration (AE), pp. 115–124.

LICS-1994-Clarke #automation #concurrent #finite #verification

Automatic Verification of Finite-State Concurrent Systems (EMC), p. 126.

LICS-1994-CharatonikP #constraints #set #similarity

Negative Set Constraints with Equality (WC, LP), pp. 128–136.

LICS-1994-Stefansson #constraints #set

Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete (KS), pp. 137–141.

LICS-1994-AndersenSW #calculus #composition #proving #μ-calculus

A Compositional Proof System for the Modal μ-Calculus (HRA, CS, GW), pp. 144–153.

LICS-1994-ZhangSS #calculus #complexity #model checking #on the #parallel #μ-calculus

On the Parallel Complexity of Model Checking in the Modal μ-Calculus (SZ, OS, SAS), pp. 154–163.

LICS-1994-Hemaspaandra #complexity #logic

Complexity Transfer for Modal Logic (EH), pp. 164–173.

LICS-1994-Wells #decidability #higher-order #λ-calculus

Typability and Type-Checking in the Second-Order λ-Calculus are Equivalent and Undecidable (JBW), pp. 176–185.

LICS-1994-Palsberg #performance

Efficient Inference of Object Types (JP), pp. 186–195.

LICS-1994-PipernoR #type inference

Type Inference and Extensionality (AP, SRDR), pp. 196–205.

LICS-1994-HofmannS #proving

The Groupoid Model Refutes Uniqueness of Identity Proofs (MH, TS), pp. 208–212.

LICS-1994-BaazFL #proving

A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation (MB, CGF, AL), pp. 213–219.

LICS-1994-ImpagliazzoPU #bound #proving

Upper and Lower Bounds for Tree-Like Cutting Planes Proofs (RI, TP, AU), pp. 220–228.

LICS-1994-AbiteboulPV #power of #relational

The Power of Reflective Relational Machines (SA, CHP, VV), pp. 230–240.

LICS-1994-MedinaI

A Syntactic Characterization of NP-Completeness (JAM, NI), pp. 241–250.

LICS-1994-Stark #declarative #prolog #semantics

The Declarative Semantics of the Prolog Selection Rule (RFS), pp. 252–261.

LICS-1994-BrogiT #algebra #logic #semantics #source code

Semantics of Meta-Logic in an Algebra of Programs (AB, FT), pp. 262–270.

LICS-1994-Miller #logic #multi

A Multiple-Conclusion Meta-Logic (DM), pp. 272–281.

LICS-1994-LincolnS #calculus #first-order #linear #logic #proving

Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi (PL, NS), pp. 282–291.

LICS-1994-Loader #linear #logic

Linear Logic, Totality and Full Completeness (RL), pp. 292–298.

LICS-1994-Urzyczyn #problem

The Emptiness Problem for Intersection Types (PU), pp. 300–309.

LICS-1994-PlotkinAC #parametricity #type system

Subtyping and Parametricity (GDP, MA, LC), pp. 310–319.

LICS-1994-GeuversW #on the #type system

On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study (HG, BW), pp. 320–329.

LICS-1994-AbadiC #semantics

A Semantics of Object Types (MA, LC), pp. 332–341.

LICS-1994-Reddy #independence

Passivity and Independence (USR), pp. 342–352.

LICS-1994-Moggi #evaluation #logic #semantics

A General Semantics for Evaluation Logic (EM), pp. 353–362.

LICS-1994-RobinsonR #graph #morphism #parametricity #polymorphism #reflexive

Reflexive Graphs and Parametric Polymorphism (EPR, GR), pp. 364–371.

LICS-1994-BrownH #category theory #design

Categories, Allegories and Circuit Design (CB, GH), pp. 372–381.

LICS-1994-BachmairG #transitive

Rewrite Techniques for Transitive Relations (LB, HG), pp. 384–393.

LICS-1994-Marche #normalisation

Normalised Rewriting and Normalised Completion (CM), pp. 394–403.

LICS-1994-BarbaneraFG #algebra #composition #confluence #normalisation

Modularity of Strong Normalization and Confluence in the algebraic-λ-Cube (FB, MF, HG), pp. 406–415.

LICS-1994-AriolaK #graph grammar

Cyclic λ Graph Rewriting (ZMA, JWK), pp. 416–425.

LICS-1994-AspertiDLR #λ-calculus

Paths in the λ-calculus (AA, VD, CL, LR), pp. 426–436.

LICS-1994-Thiagarajan #linear #logic

A Trace Based Extension of Linear Time Temporal Logic (PST), pp. 438–447.

LICS-1994-Meyden #axiom #distributed

Axioms for Knowledge and Time in Distributed Systems with Perfect Recall (RvdM), pp. 448–457.

LICS-1994-ChangMP #composition #realtime #verification

Compositional Verification of Real-Time Systems (EYC, ZM, AP), pp. 458–465.

LICS-1994-ArieliA #consistency #logic

Logical Bilattices and Inconsistent Data (OA, AA), pp. 468–476.

LICS-1994-Ben-DavidB #logic #reasoning

a modal logic for subjective default reasoning (SBD, RBE), pp. 477–486.

LICS-1994-Pentus #calculus

Language Completeness of the Lambek Calculus (MP), pp. 487–496.

LICS-1994-Goubault

Rigid E-Unifiability is DEXPTIME-Complete (JG), pp. 498–506.

LICS-1994-Prehofer #higher-order

Higher-Order Narrowing (CP), pp. 507–516.