5. LICS 1990: Philadelphia, Pennsylvania, USA

• A. J. Kfoury, Jerzy Tiuryn:
  Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary). 2-11
  
• Edmund Robinson, Giuseppe Rosolini:
  Polymorphism, Set Theory, and Call-by-Value. 12-18
  
• Manfred Droste, Rüdiger Göbel:
  Universal Domains in the Theory of Denotational Semantics of Programming Languages. 19-34
  
• Achim Jung:
  The Classification of Continuous Domains (Extended Abstract). 35-40
  
• Nevin Heintze, Joxan Jaffar:
  A Decision Procedure for a Class of Set Constraints (Extended Abstract). 42-51
  
• Jean-Louis Lassez, Ken McAloon:
  A Constraint Sequent Calculus. 52-61
  
• Hubert Comon:
  Solving Inequations in Term Algebras (Extended Abstract). 62-69
  
• Ron van der Meyden:
  The Dynamic Logic of Permission. 72-78
  
• V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
  A Theory of Nonmonotonic Rule Systems. 79-94
  
• Stuart F. Allen, Robert L. Constable, Douglas J. Howe, William E. Aitken:
  The Semantics of Reflected Proof. 95-105
  
• Kim Guldstrand Larsen, Liu Xinxin:
  Equation Solving Using Modal Transition Systems. 108-117
  
• Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen, Chris M. N. Tofts:
  Reactive, Generative, and Stratified Models of Probabilistic Processes. 130-141
  
• Faron Moller:
  The Nonexistence of Finite Axiomatisations for CCS Congruences. 142-153
  
• Phokion G. Kolaitis, Moshe Y. Vardi:
  0-1 Laws for Infinitary Logics (Preliminary Report). 156-167
  
• Phokion G. Kolaitis:
  Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report). 168-180
  
• Peter Clote:
  ALOGTIME and a Conjecture of S. A. Cook (Extended Abstract). 181-189
  
• Bruno Courcelle:
  On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract). 190-196
  
• Vijay Gehlot, Carl A. Gunter:
  Normal Process Representatives. 200-207
  
• Carolyn Brown, Doug Gurr:
  A Categorical Linear Framework for Petri Nets. 208-218
  
• Serenella Cerrito:
  A Linear Semantics for Allowed Logic Programs. 219-227
  
• R. C. Sekar, I. V. Ramakrishnan:
  Programming in Equational Logic: Beyond Strong Sequentiality. 230-241
  
• Max Dauchet, Sophie Tison:
  The Theory of Ground Rewrite Systems is Decidable. 242-248
  
• Pierre Lescanne:
  Well Rewrite Orderings. 249-256
  
• Chetan R. Murthy, James R. Russell:
  A Constructive Proof of Higman's Lemma. 257-267
  
• Claude Kirchner, Francis Klay:
  Syntactic Theories and Unification. 270-277
  
• Tobias Nipkow:
  Proof Transformations for Equational Theories. 278-288
  
• Alexandre Boudet, Evelyne Contejean, Hervé Devie:
  A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations. 289-299
  
• Jochen Dörre, William C. Rounds:
  On Subsumption and Semiunification in Feature Algebras. 300-310
  
• Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke:
  Completeness for typed lazy inequalities. 312-320
  
• Mitchell Wand, Zheng-Yu Wang:
  Conditional Lambda-Theories and the Verification of Static Properties of Programs. 321-332
  
• Juan C. Guzmán, Paul Hudak:
  Single-Threaded Polymorphic Lambda Calculus. 333-343
  
• Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott:
  Extensional PERs. 346-354
  
• Martín Abadi, Gordon D. Plotkin:
  A Per Model of Polymorphism and Recursive Types. 355-365
  
• Wesley Phoa:
  Effective Domains and Intrinsic Structure. 366-377
  
• Harry R. Lewis:
  A Logic of Concrete Time Intervals (Extended Abstract). 380-389
  
• Rajeev Alur, Thomas A. Henzinger:
  Real-time Logics: Complexity and Expressiveness. 390-401
  
• Eyal Harel, Orna Lichtenstein, Amir Pnueli:
  Explicit Clock Temporal Logic. 402-413
  
• Rajeev Alur, Costas Courcoubetis, David L. Dill:
  Model-Checking for Real-Time Systems. 414-425
  
• Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, L. J. Hwang:
  Symbolic Model Checking: 10^20 States and Beyond. 428-439
  
• Rance Cleaveland, Bernhard Steffen:
  When is ``Partial'' Adequate? A Logic-Based Proof Technique Using Partial Specifications. 440-449
  
• Kenneth J. Goldman, Nancy A. Lynch:
  Modelling Shared State in a Shared Action Model. 450-463
  
• E. Allen Emerson, Michael Evangelist, Jai Srinivasan:
  On the Limits of Efficient Temporal Decidability (Extended Abstract). 464-475
  
• David Harel, Roni Rosner, Moshe Y. Vardi:
  On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report). 478-488
  
• Roy L. Crole, Andrew M. Pitts:
  New Foundations for Fixpoint Computations. 489-497
  
• Peter J. Freyd:
  Recursive Types Reduced to Inductive Types. 498-507
  

Last update Fri May 25 08:25:20 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page