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

Proceedings of the Sixth Annual Symposium on Logic in Computer Science
LICS, 1991.

TEST

@proceedings{LICS-1991,
	address       = "Amsterdam, The Netherlands",
	isbn          = "0-8186-2230-X",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the Sixth Annual Symposium on Logic in Computer Science}",
	year          = 1991,
}

Contents (40 items)

LICS-1991-Leivant: A Foundational Delineation of Computational Feasiblity (DL), pp. 2–11.
LICS-1991-AlessiB #semantics #towards: Towards a Semantics for the QUEST Language (FA, FB), pp. 12–21.
LICS-1991-Aczel #logic: Term Declaration Logic and Generalised Composita (PA), pp. 22–30.
LICS-1991-HodasM #linear #logic programming: Logic Programming in a Fragment of Intuitionistic Linear Logic (JSH, DM), pp. 32–42.
LICS-1991-LafontS #game studies #linear #logic #semantics: Games Semantics for Linear Logic (YL, TS), pp. 43–50.
LICS-1991-LincolnSS: Linearizing Intuitionistic Implication (PL, AS, NS), pp. 51–62.
LICS-1991-MalacariaR #algebra #λ-calculus: Some Results on the Interpretation of λ-calculus in Operator Algebras (PM, LR), pp. 63–72.
LICS-1991-Pfenning #anti #calculus #unification: Unification and Anti-Unification in the Calculus of Constructions (FP), pp. 74–85.
LICS-1991-Audebaud #calculus: Partial Objects in the Calculus of Constructions (PA), pp. 86–95.
LICS-1991-Murthy #evaluation #proving #semantics: An Evaluation Semantics for Classical Proofs (CRM), pp. 96–107.
LICS-1991-CleavelandZ #formal method #realtime #testing: A Theory of Testing for Real-Time (RC, AEZ), pp. 110–119.
LICS-1991-Hungar #bound #complexity #hoare #proving: Complexity Bounds of Hoare-style Proof Systems (HH), pp. 120–126.
LICS-1991-HungZ #logic #pointer #semantics: Semantics of Pointers, Referencing and Dereferencing with Intensional Logic (HKH, JIZ), pp. 127–136.
LICS-1991-BucciarelliE: Sequentiality and Strong Stability (AB, TE), pp. 138–145.
LICS-1991-Stoughton #parallel: Parallel PCF Has a Unique Extensional Model (AS), pp. 146–151.
LICS-1991-Taylor #fixpoint: The Fixed Point Property in Synthetic Domain Theory (PT0), pp. 152–160.
LICS-1991-Howe #on the #type system: On Computational Open-Endedness in Martin-Löf’s Type Theory (DJH), pp. 162–172.
LICS-1991-Mendler #recursion: Predicative Type Universes and Primitive Recursion (NPM), pp. 173–184.
LICS-1991-Statman #combinator #monad: Freyd’s Hierarchy of Combinator Monoids (RS), pp. 186–190.
LICS-1991-Tronci #equation #λ-calculus: Equational Prgoramming in λ-calculus (ET), pp. 191–202.
LICS-1991-BergerS #evaluation #functional #λ-calculus: An Inverse of the Evaluation Functional for Typed λ-calculus (UB, HS), pp. 203–211.
LICS-1991-Kozen #algebra #theorem: A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events (DK), pp. 214–225.
LICS-1991-AvronH #database #first-order #on the #query: On First Order Database Query Languages (AA, YH), pp. 226–231.
LICS-1991-PeledKP #logic #proving #specification: Specifying and Proving Serializability in Temporal Logic (DP, SK, AP), pp. 232–244.
LICS-1991-CamilleriW: CCS with Priority Choice (JC, GW), pp. 246–255.
LICS-1991-KlarlundK #automaton #metric: Rabin Measures and Their Applications to Fairness and Automata Theory (NK, DK), pp. 256–265.
LICS-1991-JonssonL #probability #process #refinement #specification: Specification and Refinement of Probabilistic Processes (BJ, KGL), pp. 266–277.
LICS-1991-PacholskiS #higher-order #on the #similarity: On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality (LP, WS), pp. 280–285.
LICS-1991-BonetB #deduction #on the #proving: On the Deduction Rule and the Number of Proof Lines (MLB, SRB), pp. 286–297.
LICS-1991-FruhwirthSVY #logic programming #source code: Logic Programs as Types for Logic Programs (TWF, EYS, MYV, EY), pp. 300–309.
LICS-1991-KiferW #first-order #logic programming #morphism #polymorphism: A First-Order Theory of Types and Polymorphism in Logic Programming (MK, JW), pp. 310–321.
LICS-1991-CortesiFW #abstract domain #analysis: Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis (AC, GF, WHW), pp. 322–327.
LICS-1991-Stuckey #constraints #logic programming: Constructive Negation for Constraint Logic Programming (PJS), pp. 328–339.
LICS-1991-Nipkow #higher-order: Higher-Order Critical Pairs (TN), pp. 342–349.
LICS-1991-JouannaudO #algebra #execution #higher-order #specification: A Computation Model for Executable Higher-Order Algebraic Specification Languages (JPJ, MO), pp. 350–361.
LICS-1991-Ryan: Defaults and Revision in Structured Theories (MR), pp. 362–373.
LICS-1991-HuttelS #process #proving #similarity #word: Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes (HH, CS), pp. 376–386.
LICS-1991-Vaandrager #algebra #automaton #on the #process: On the Relationship Between Process Algebra and Input/Output Automata (FWV), pp. 387–398.
LICS-1991-Boer #composition #process #proving: A Compositional Proof System for Dynamic Process Creation (FSdB), pp. 399–405.
LICS-1991-GodefroidW #approach #model checking: A Partial Approach to Model Checking (PG, PW), pp. 406–415.

Proceedings of the Sixth Annual Symposium on Logic in Computer ScienceLICS, 1991.

Contents (40 items)

Proceedings of the Sixth Annual Symposium on Logic in Computer Science
LICS, 1991.