BibSLEIGH — Proceedings of the Third Annual Symposium on Logic in Computer Science

Proceedings of the Third Annual Symposium on Logic in Computer Science
LICS, 1988.

TEST

@proceedings{LICS-1988,
	address       = "Edinburgh, Scotland, United Kingdom",
	isbn          = "0-8186-0853-6",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the Third Annual Symposium on Logic in Computer Science}",
	year          = 1988,
}

Contents (43 items)

LICS-1988-KolaitisV #higher-order #logic #problem: 0-1 Laws and Decision Problems for Fragments of Second-Order Logic (PGK, MYV), pp. 2–11.
LICS-1988-ComptonL #algebra #logic: An Algebra and a Logic for NC¹ (KJC, CL), pp. 12–21.
LICS-1988-Tiomkin #proving: Proving unprovability (MLT), pp. 22–26.
LICS-1988-HoareG #correctness #logic: Partial Correctness of C-MOS Switching Circuits: An Exercise in Applied Logic (CARH, MJCG), pp. 28–36.
LICS-1988-BruceL #bound #inheritance #quantifier: A Modest Model of Records, Inheritance and Bounded Quantification (KBB, GL), pp. 38–50.
LICS-1988-Amadio #fixpoint #higher-order #modelling #λ-calculus: A fixed point extension of the second order λ-calculus: observable equivalences and models (RMA), pp. 51–60.
LICS-1988-GianniniR #polymorphism: Characterization of typings in polymorphic type discipline (PG, SRDR), pp. 61–70.
LICS-1988-KfouryTU #on the #polymorphism #power of #recursion: On the Computational Power of Universally Polymorphic Recursion (AJK, JT, PU), pp. 72–81.
LICS-1988-Breazu-Tannen88a #algebra #higher-order: Combining Algebra and Higher-Order Types (VT), pp. 82–90.
LICS-1988-BohmP #calculus: Characterizing X-Separability and One-Side Invertibility in λ-β-Ω-Calculus (CB, AP), pp. 91–101.
LICS-1988-DershowitzO #term rewriting: Proof-Theoretic Techniques for Term Rewriting Theory (ND, MO), pp. 104–111.
LICS-1988-KuperMPP #algorithm #anti #parallel #performance: Efficient Parallel Algorithms for Anti-Unification and Relative Complement (GMK, KM, KVP, KJP), pp. 112–120.
LICS-1988-BoudetJS #unification: Unification in Free Extensions of Boolean Rings and Abelian Groups (AB, JPJ, MSS), pp. 121–130.
LICS-1988-Wand #named #type inference: Corrigendum: Complete Type Inference for Simple Objects (MW), p. 132.
LICS-1988-DeganoNM #concurrent #consistency #on the #semantics: On the Consistency of “Truly Concurrent” Operational and Denotational Semantics (PD, RDN, UM), pp. 133–141.
LICS-1988-Winskel #composition #petri net #proving: A Category of Labelled Petri Nets and Compositional Proof System (GW), pp. 142–154.
LICS-1988-MeseguerM #algebra #monad #petri net: Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory (JM, UM), pp. 155–164.
LICS-1988-AbadiL #refinement: The Existence of Refinement Mappings (MA, LL), pp. 165–175.
LICS-1988-Dam #composition #concurrent #logic: Relevance Logic and Concurrent Composition (MD), pp. 178–185.
LICS-1988-Walker #bisimulation: Bisimulations and Divergence (DJW), pp. 186–192.
LICS-1988-CleavelandH #algebra #process: Priorities in Process Algebras (RC, MH), pp. 193–202.
LICS-1988-LarsenT #logic #process: A Modal Process Logic (KGL, BT), pp. 203–210.
LICS-1988-Vorobyov #on the #term rewriting: On the Arithmetic Inexpressiveness of Term Rewriting Systems (SGV), pp. 212–217.
LICS-1988-GallierSNP: Rigid E-Unification is NP-Complete (JHG, WS, PN, DAP), pp. 218–227.
LICS-1988-Bachmair #consistency #equation #proving: Proof by Consistency in Equational Theories (LB), pp. 228–233.
LICS-1988-Meyer #paradigm #semantics: Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis (ARM), pp. 236–253.
LICS-1988-Coquand #category theory: Categories of Embeddings (TC), pp. 256–263.
LICS-1988-Ehrhard #category theory #semantics: A Categorical Semantics of Constructions (TE), pp. 264–273.
LICS-1988-FreydGSS #parametricity #polymorphism #semantics #λ-calculus: Semantic Parametricity in Polymorphic λ Calculus (PJF, JYG, AS, PJS), pp. 274–279.
LICS-1988-Bloom #modelling #λ-calculus: Can LCF Be Topped? Flat Lattice models of Typed λ Calculus (BB), pp. 282–295.
LICS-1988-CartwrightD #termination: The Topology of Program Termination (RC, AJD), pp. 296–308.
LICS-1988-GunterJ #consistency: Coherence and Consistency in Domains (CAG, AJ), pp. 309–317.
LICS-1988-GerthCLS #concurrent #prolog #semantics: Fully Abstract Denotational Semantics for Flat Concurrent Prolog (RG, MC, YL, EYS), pp. 320–335.
LICS-1988-Baudinet #approach #prolog #proving #semantics #source code #termination: Proving Termination Properties of Prolog Programs: A Semantic Approach (MB), pp. 336–347.
LICS-1988-Maher #algebra #axiom #finite #infinity: Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees (MJM), pp. 348–357.
LICS-1988-ConstableS #recursion: Computational Foundations of Basic Recursive Function Theory (RLC, SFS), pp. 360–371.
LICS-1988-Griffin #formal method: Notational definition — a formal account (TG), pp. 372–383.
LICS-1988-SalvesenS #set #type system: The Strength of the Subset Type in Martin-Löf’s Type Theory (AS, JMS), pp. 384–391.
LICS-1988-MendlerA #framework: The notion of a Framework and a framework for LTC (PFM, PA), pp. 392–399.
LICS-1988-Niwinski #fixpoint #generative #infinity: Fixed Points vs. Infinite Generation (DN), pp. 402–409.
LICS-1988-FaginHM #logic #reasoning: A Logic for Reasoning about Probabilities (RF, JYH, NM), pp. 410–421.
LICS-1988-MullerSS #automaton #decidability #exponential #logic #why: Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time (DEM, AS, PES), pp. 422–427.
LICS-1988-GrabowskiH #effectiveness #hoare #logic #on the: On the Existence of Effective Hoare Logics (MG, HH), pp. 428–435.

Proceedings of the Third Annual Symposium on Logic in Computer ScienceLICS, 1988.

Contents (43 items)

Proceedings of the Third Annual Symposium on Logic in Computer Science
LICS, 1988.