• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

• 1995
• 
  Andrea Asperti, Cosimo Laneve:
  Comparing Lambda-calculus translations in Sharing Graphs. TLCA 1995: 1-15
• 
  Gilles Barthe:
  Extensions of Pure Type Systems. TLCA 1995: 16-31
• 
  Roberto Bellucci, Martín Abadi, Pierre-Louis Curien:
  A Model for Formal Parametric Polymorphism: A PER Interpretation for System R. TLCA 1995: 32-46
• 
  Stefano Berardi, Luca Boerio:
  Using Subtyping in Program Optimization. TLCA 1995: 63-77
• 
  Stefano Berardi, Marc Bezem, Thierry Coquand:
  A realization of the negative interpretation of the Axiom of Choice. TLCA 1995: 47-62
• 
  Gavin M. Bierman:
  What is a Categorical Model of Intuitionistic Linear Logic? TLCA 1995: 78-93
• 
  Daniel Briaud:
  An explicit Eta rewrite rule. TLCA 1995: 94-108
• 
  Yann Coscoy, Gilles Kahn, Laurent Théry:
  Extracting Text from Proofs. TLCA 1995: 109-123
• 
  Roberto Di Cosmo, Adolfo Piperno:
  Expanding Extensional Polymorphism. TLCA 1995: 139-153
• 
  Joëlle Despeyroux, Amy P. Felty, André Hirschowitz:
  Higher-Order Abstract Syntax in Coq. TLCA 1995: 124-138
• 
  Gilles Dowek:
  Lambda-calculus, Combinators and the Comprehension Scheme. TLCA 1995: 154-170
• 
  Neil Ghani:
  ßn-Equality for Coproducts. TLCA 1995: 171-185
• 
  Healfdene Goguen:
  Typed Operational Semantics. TLCA 1995: 186-200
• 
  Philippe de Groote:
  A Simple Calculus of Exception Handling. TLCA 1995: 201-215
• 
  Martin Hofmann:
  A Simple Model for Quotient Types. TLCA 1995: 216-234
• 
  M. Randall Holmes:
  Untyped lambda-Calculus with Relative Typing. TLCA 1995: 235-248
• 
  Furio Honsell, Marina Lenisa:
  Final Semantics for untyped lambda-calculus. TLCA 1995: 249-265
• 
  Antonius J. C. Hurkens:
  A Simplification of Girard's Paradox. TLCA 1995: 266-278
• 
  Hidetaka Kondoh:
  Basic Properties of Data Types with Inequational Refinements. TLCA 1995: 279-296
• 
  Toshihiko Kurata, Masako Takahashi:
  Decidable Properties of Intersection Type Systems. TLCA 1995: 297-311
• 
  François Leclerc:
  Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq. TLCA 1995: 312-327
• 
  Paul-André Melliès:
  Typed lambda-calculi with explicit substitutions may not terminate. TLCA 1995: 328-334
• 
  Vincent Padovani:
  On Equivalence Classes of Interpolation Equations. TLCA 1995: 335-349
• 
  Jaco van de Pol, Helmut Schwichtenberg:
  Strict Functionals for Termination Proofs. TLCA 1995: 350-364
• 
  Robert Pollack:
  A Verified Typechecker. TLCA 1995: 365-380
• 
  Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi:
  Categorical semantics of the call-by-value lambda-calculus. TLCA 1995: 381-396
• 
  Eike Ritter, Andrew M. Pitts:
  A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML. TLCA 1995: 397-413
• 
  Alex K. Simpson:
  Categorical completeness results for the simply-typed lambda-calculus. TLCA 1995: 414-427
• 
  Jan Springintveld:
  Third-Order Matching in the Presence of Type Constructors. TLCA 1995: 428-442
• 
  Mariangiola Dezani-Ciancaglini, Gordon D. Plotkin:
  Typed Lambda Calculi and Applications, Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, UK, April 10-12, 1995, Proceedings. Lecture Notes in Computer Science 902, Springer 1995, ISBN 3-540-59048-X [contents]