Proceedings of the Seventh Annual Symposium on Logic in Computer Science
LICS, 1992.

@proceedings{LICS-1992,
	address       = "Santa Cruz, California, USA",
	isbn          = "0-8186-2735-2",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the Seventh Annual Symposium on Logic in Computer Science}",
	year          = 1992,
}

Contents (44 items)

7 ×#logic
5 ×#linear
4 ×#λ-calculus
3 ×#set
2 ×#analysis
2 ×#axiom
2 ×#calculus
2 ×#constraints
2 ×#decidability
2 ×#equation

LICS-1992-Dowek #decidability #higher-order

Third Order Matching is Decidable (GD), pp. 2–10.

LICS-1992-KapurN #complexity #set

Double-exponential Complexity of Computing a Complete Set of AC-Unifiers (DK, PN), pp. 11–21.

LICS-1992-GroveHK #random

Random Worlds and Maximum Entropy (AJG, JYH, DK), pp. 22–33.

LICS-1992-Schwarz #logic #semantics

Minimal Model Semantics for Nonmonotonic Modal Logics (GS), pp. 34–43.

LICS-1992-KolaitisV #fixpoint #logic

Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory (PGK, MYV), pp. 46–57.

LICS-1992-GraedelM #logic #nondeterminism #transitive

Deterministic vs. Nondeterministic Transitive Closure Logic (EG, GLM), pp. 58–63.

LICS-1992-Stolboushkin #axiom #finite #linear #modelling #order

Axiomatizable Classes of Finite Models and Definability of Linear Order (APS), pp. 64–70.

LICS-1992-GonthierLM #standard #theorem

An abstract standardisation theorem (GG, JJL, PAM), pp. 72–81.

LICS-1992-Nakano #formal method

A Constructive Formalization of the Catch and Throw Mechanism (HN), pp. 82–89.

LICS-1992-Murthy #analysis

A Computational Analysis of Girard’s Translation and LC (CRM), pp. 90–101.

LICS-1992-Sangiorgi #concurrent #lazy evaluation #λ-calculus

The Lazy λ Calculus in a Concurrency Scenario (DS), pp. 102–109.

LICS-1992-Wing #development #specification

Specification in Software Development (JMW), p. 112.

LICS-1992-AcetoBV #equation

Turning SOS Rules into Equations (LA, BB, FWV), pp. 113–124.

LICS-1992-Stark #calculus #data flow #network

A Calculus of Dataflow Networks (EWS), pp. 125–136.

LICS-1992-BoerKP #algebra #communication #process

Asynchronous Communication in Process Algebra (FSdB, JWK, CP), pp. 137–147.

LICS-1992-Ulidowski #process

Equivalences on Observable Processes (IU), pp. 148–159.

LICS-1992-TalpinJ

The Type and Effect Discipline (JPT, PJ), pp. 162–173.

LICS-1992-Jensen #analysis #strict

Disjunctive Strictness Analysis (TPJ), pp. 174–185.

LICS-1992-MasonT #reasoning

References, Local Variables and Operational Reasoning (IAM, CLT), pp. 186–197.

LICS-1992-Kanovich #linear #logic #programming

Horn Programming in Linear Logic Is NP-Complete (MIK), pp. 200–210.

LICS-1992-AbramskyJ #geometry #interactive

New Foundations for the Geometry of Interaction (SA, RJ), pp. 211–222.

LICS-1992-GonthierAL #linear #logic

Linear Logic Without Boxes (GG, MA, JJL), pp. 223–234.

LICS-1992-LincolnM #aspect-oriented #linear #λ-calculus

Operational aspects of linear λ calculus (PL, JCM), pp. 235–246.

LICS-1992-Pratt #calculus

Origins of the Calculus of Binary Relations (VRP), pp. 248–254.

LICS-1992-ComonHJ #decidability #equation #problem

Decidable Problems in Shallow Equational Theories (HC, MH, JPJ), pp. 255–265.

LICS-1992-Caucal #monad #term rewriting

Monadic Theory of Term Rewritings (DC), pp. 266–273.

LICS-1992-Toyama #linear #term rewriting

Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems (YT), pp. 274–284.

LICS-1992-Seth #axiom #recursion

There is No Recursive Axiomatization for Feasible Functionals of Type~2 (AS), pp. 286–295.

LICS-1992-Clote #constant #proving

Cutting Planes and constant depth Frege proofs (PC), pp. 296–307.

LICS-1992-Tiuryn #type system

Subtype Inequalities (JT), pp. 308–315.

LICS-1992-HeintzeJ #logic programming #program analysis

An Engine for Logic Program Analysis (NH, JJ), pp. 318–328.

LICS-1992-AikenW #constraints #set

Solving Systems of Set Constraints (AA, ELW), pp. 329–340.

LICS-1992-Saraswat #constraints

The Category of Constraint Systems is Cartesian-Closed (VAS), pp. 341–345.

LICS-1992-VaananenK #finite #game studies #quantifier

Generalized Quantifiers and Pebble Games on Finite Structures (PGK, JAV), pp. 348–359.

LICS-1992-Hella #logic

Logical Hierarchies in PTIME (LH), pp. 360–368.

LICS-1992-HalpernK #logic

Zero-One Laws for Modal Logic (JYH, BMK), pp. 369–380.

LICS-1992-Klarlund #automaton #metric #set

Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata (NK), pp. 382–393.

LICS-1992-HenzingerNSY #model checking #realtime

Symbolic Model Checking for Real-time Systems (TAH, XN, JS, SY), pp. 394–406.

LICS-1992-PfenningH #compilation #verification

Compiler Verification in LF (JH, FP), pp. 407–418.

LICS-1992-Fribourg #recursion

Mixing List Recursion and Arithmetic (LF), pp. 419–429.

LICS-1992-Curien #algorithm #data type

Observable Algorithms on Concrete Data Structures (PLC), pp. 432–443.

LICS-1992-FreydRR #parametricity

Functorial Parametricity (PJF, EPR, GR), pp. 444–452.

LICS-1992-Geuvers #λ-calculus

The Church-Rosser Property for βη-reduction in Typed λ-Calculi (HG), pp. 453–460.

LICS-1992-LiguoroPS #λ-calculus

Retracts in simply typed λβη-calculus (Ud, AP, RS), pp. 461–469.