• 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 20 matches

• 1996
• 
  Stefano Berardi, Mario Coppo:
  Types for Proofs and Programs, International Workshop TYPES'95, Torino, Italy, June 5-8, 1995, Selected Papers. Lecture Notes in Computer Science 1158, Springer 1996, ISBN 3-540-61780-9 [contents]
• 1995
• 
  Gilles Barthe:
  Implicit Coercions in Type Systems. TYPES 1995: 1-15
• 
  Gilles Barthe, Mark Ruys, Henk Barendregt:
  A Two-Level Approach Towards Lean Proof-Checking. TYPES 1995: 16-35
• 
  Ulrich Berger, Helmut Schwichtenberg:
  The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs. TYPES 1995: 36-46
• 
  Ilya Beylin, Peter Dybjer:
  Extracting a Proof of Coherence for Monoidal Categories from a Proof of Normalization for Monoids. TYPES 1995: 47-61
• 
  Jan Cederquist, Sara Negri:
  A Constructive Proof of the Heine-Borel Covering Theorem for Formal Reals. TYPES 1995: 62-75
• 
  Thierry Coquand, Jan M. Smith:
  An Application of Constructive Completeness. TYPES 1995: 76-84
• 
  Cristina Cornes, Delphine Terrasse:
  Automating Inversion of Inductive Predicates in Coq. TYPES 1995: 85-104
• 
  Philippe Curmin:
  First Order Marked Types. TYPES 1995: 105-119
• 
  Peter Dybjer:
  Internal Type Theory. TYPES 1995: 120-134
• 
  Eduardo Giménez:
  An Application of Co-inductive Types in Coq: Verification of the Alternating Bit Protocol. TYPES 1995: 135-152
• 
  Martin Hofmann:
  Conservativity of Equality Reflection over Intensional Type Theory. TYPES 1995: 153-164
• 
  Furio Honsell, Marino Miculan:
  A Natural Deduction Approach to Dynamic Logic. TYPES 1995: 165-182
• 
  Lena Magnusson:
  An Algorithm for Checking Incomplete Proof Objects in Type Theory with Localization and Unification. TYPES 1995: 183-200
• 
  Vincent Padovani:
  Decidability of All Minimal Models. TYPES 1995: 201-215
• 
  Christine Paulin-Mohring:
  Circuits as Streams in Coq: Verification of a Sequential Multiplier. TYPES 1995: 216-230
• 
  Jan von Plato:
  Organization and Development of a Constructive Axiomatization. TYPES 1995: 288-296
• 
  Aarne Ranta:
  Context-Relative Syntactic Categories and the Formalization of Mathematical Text. TYPES 1995: 231-248
• 
  Milena Stefanova, Herman Geuvers:
  A Simple Model Construction for the Calculus of Constructions. TYPES 1995: 249-264
• 
  Tanel Tammet, Jan M. Smith:
  Optimized Encodings of Fragments of Type Theory in First Order Logic. TYPES 1995: 265-287