6. LICS 1991: Amsterdam, The Netherlands

• Daniel Leivant:
  A Foundational Delineation of Computational Feasiblity. 2-11
  
• Fabio Alessi, Franco Barbanera:
  Towards a Semantics for the QUEST Language. 12-21
  
• Peter Aczel:
  Term Declaration Logic and Generalised Composita. 22-30
  
• Joshua S. Hodas, Dale Miller:
  Logic Programming in a Fragment of Intuitionistic Linear Logic. 32-42
  
• Yves Lafont, Thomas Streicher:
  Games Semantics for Linear Logic. 43-50
  
• Patrick Lincoln, Andre Scedrov, Natarajan Shankar:
  Linearizing Intuitionistic Implication. 51-62
  
• Pasquale Malacaria, Laurent Regnier:
  Some Results on the Interpretation of lambda-calculus in Operator Algebras. 63-72
  
• Frank Pfenning:
  Unification and Anti-Unification in the Calculus of Constructions. 74-85
  
• Philippe Audebaud:
  Partial Objects in the Calculus of Constructions. 86-95
  
• Chetan R. Murthy:
  An Evaluation Semantics for Classical Proofs. 96-107
  
• Rance Cleaveland, Amy E. Zwarico:
  A Theory of Testing for Real-Time. 110-119
  
• Hardi Hungar:
  Complexity Bounds of Hoare-style Proof Systems. 120-126
  
• Hing-Kai Hung, Jeffery I. Zucker:
  Semantics of Pointers, Referencing and Dereferencing with Intensional Logic. 127-136
  
• Antonio Bucciarelli, Thomas Ehrhard:
  Sequentiality and Strong Stability. 138-145
  
• Allen Stoughton:
  Parallel PCF Has a Unique Extensional Model. 146-151
  
• Paul Taylor:
  The Fixed Point Property in Synthetic Domain Theory. 152-160
  
• Douglas J. Howe:
  On Computational Open-Endedness in Martin-Löf's Type Theory. 162-172
  
• Nax Paul Mendler:
  Predicative Type Universes and Primitive Recursion. 173-184
  
• Richard Statman:
  Freyd's Hierarchy of Combinator Monoids. 186-190
  
• Enrico Tronci:
  Equational Prgoramming in lambda-calculus. 191-202
  
• Ulrich Berger, Helmut Schwichtenberg:
  An Inverse of the Evaluation Functional for Typed lambda-calculus. 203-211
  
• Dexter Kozen:
  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. 214-225
  
• Arnon Avron, Yoram Hirshfeld:
  On First Order Database Query Languages. 226-231
  
• Doron Peled, Shmuel Katz, Amir Pnueli:
  Specifying and Proving Serializability in Temporal Logic. 232-244
  
• Juanito Camilleri, Glynn Winskel:
  CCS with Priority Choice. 246-255
  
• Nils Klarlund, Dexter Kozen:
  Rabin Measures and Their Applications to Fairness and Automata Theory. 256-265
  
• Bengt Jonsson, Kim Guldstrand Larsen:
  Specification and Refinement of Probabilistic Processes. 266-277
  
• Leszek Pacholski, Wieslaw Szwast:
  On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality. 280-285
  
• Maria Luisa Bonet, Samuel R. Buss:
  On the Deduction Rule and the Number of Proof Lines. 286-297
  
• Thom W. Frühwirth, Ehud Y. Shapiro, Moshe Y. Vardi, Eyal Yardeni:
  Logic Programs as Types for Logic Programs. 300-309
  
• Michael Kifer, James Wu:
  A First-Order Theory of Types and Polymorphism in Logic Programming. 310-321
  
• Agostino Cortesi, Gilberto Filé, William H. Winsborough:
  Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis. 322-327
  
• Peter J. Stuckey:
  Constructive Negation for Constraint Logic Programming. 328-339
  
• Tobias Nipkow:
  Higher-Order Critical Pairs. 342-349
  
• Jean-Pierre Jouannaud, Mitsuhiro Okada:
  A Computation Model for Executable Higher-Order Algebraic Specification Languages. 350-361
  
• Mark Ryan:
  Defaults and Revision in Structured Theories. 362-373
  
• Hans Hüttel, Colin Stirling:
  Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes. 376-386
  
• Frits W. Vaandrager:
  On the Relationship Between Process Algebra and Input/Output Automata. 387-398
  
• Frank S. de Boer:
  A Compositional Proof System for Dynamic Process Creation. 399-405
  
• Patrice Godefroid, Pierre Wolper:
  A Partial Approach to Model Checking. 406-415
  

Last update Sun May 19 23:07:48 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page