8. LICS 1993: Montreal, Canada

• Giuseppe Longo, Kathleen Milsted, Sergei Soloviev:
  The Genericity Theorem and the Notion of Parametricity in the Polymorphic lambda-calculus (Extended Abstract). 6-14
  
• My Hoang, John C. Mitchell, Ramesh Viswanathan:
  Standard ML-NJ weak polymorphism and imperative constructs. 15-25
  
• John C. Mitchell, Furio Honsell, Kathleen Fisher:
  A lambda calculus of objects and method specialization. 26-38
  
• Michel Parigot:
  Strong Normalization for Second Order Classical Natural Deduction. 39-46
  
• Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang:
  Automated Production of Traditional Proofs for Constructive Geometry Theorems. 48-56
  
• Paliath Narendran, Frank Pfenning, Richard Statman:
  On the Unification Problem for Cartesian Closed Categories. 57-63
  
• Tobias Nipkow:
  Functional Unification of Higher-Order Patterns. 64-74
  
• Leo Bachmair, Harald Ganzinger, Uwe Waldmann:
  Set Constraints are the Monadic Class. 75-83
  
• Stephen D. Brookes:
  Full Abstraction for a Shared Variable Parallel Language. 98-109
  
• Marcelo P. Fiore:
  A Coinduction Principle for Recursive Data Types Based on Bisimulation. 110-119
  
• Phokion G. Kolaitis: A Tutorial on Finite Model Theory (Abstract). 122
• Amir Pnueli, Lenore D. Zuck:
  In and Out of Temporal Logic. 124-135
  
• Igor Walukiewicz:
  On Completeness of the mu-calculus. 136-146
  
• Ahmed Bouajjani, Rachid Echahed, Joseph Sifakis:
  On Model Checking for Real-Time Properties with Durations. 147-159
  
• Parosh Aziz Abdulla, Bengt Jonsson:
  Verifying Programs with Unreliable Channels. 160-170
  
• Damian Niwinski, Alexei P. Stolboushkin:
  y = 2x vs. y = 3x. 172-178
  
• Bruno Courcelle:
  Monadic Second-Order Logic and Hypergraph Orientation. 179-190
  
• James F. Lynch:
  Infinitary Logics and Very Sparse Random Graphs. 191-198
  
• Guy Fayolle, Stéphane Grumbach, Christophe Tollu:
  Asymptotic Probabilities of Languages with Generalized Quantifiers. 199-207
  
• Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi:
  Compositional Analysis for Concurrent Constraint Programming. 210-221
  
• Peter Schroeder-Heister:
  Rules of Definitional Reflection. 222-232
  
• Amy P. Felty:
  Encoding the Calculus of Constructions in a Higher-Order Logic. 233-244
  
• Joachim Lambek:
  Programs, grammars and arguments: a personal view of some connections between computation, language and logic. 246-249
  
• Jon Barwise, Jerry Seligman:
  Imperfect information flow. 252-260
  
• Val Tannen, Delia Kesner, Laurence Puel:
  A Typed Pattern Calculus. 262-274
  
• C.-H. Luke Ong:
  Non-Determinism in a Functional Setting. 275-286
  
• Wesley Phoa:
  Adequacy for untyped translations of typed lambda-calculi. 287-295
  
• Vincent Danos, Laurent Regnier:
  Local and asynchronous beta-reduction (an analysis of Girard's execution formula). 296-306
  
• Paul Beame, Toniann Pitassi:
  An Exponential Separation between the Matching Principle and the Pigeonhole Principle. 308-319
  
• Anil Seth:
  Some Desirable Conditions for Feasible Functionals of Type~2. 320-331
  
• Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson:
  Database Query Languages Embedded in the Typed Lambda Calculus. 332-343
  
• Laks V. S. Lakshmanan, Karima Ashraf, Jiawei Han:
  Homomorphic Tree Embeddings and Their Applications to Recursive Program Optimization. 344-353
  
• Ursula Martin, Elizabeth Scott:
  The order types of termination orderings on monadic terms, strings and multisets. 356-363
  
• Paliath Narendran, Michaël Rusinowitch:
  The Unifiability Problem in Ground AC Theories. 364-370
  
• Gordon D. Plotkin:
  Type Theory and Recursion (Extended Abstract). 374
  
• Benjamin C. Pierce, Davide Sangiorgi:
  Typing and Subtyping for Mobile Processes. 376-385
  
• Søren Christensen, Yoram Hirshfeld, Faron Moller:
  Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes. 386-396
  
• Matthew Hennessy:
  A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract). 397-408
  
• Lalita Jategaonkar, Albert R. Meyer:
  Self-Synchronization of Concurrent Processes (Preliminary Report). 409-417
  
• André Joyal, Mogens Nielsen, Glynn Winskel:
  Bisimulation and open maps. 418-427
  
• Mati Pentus:
  Lambek Grammars Are Context Free. 429-433
  

Last update Sun May 26 02:42:51 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page