


default search action
TYPES 1998: Kloster Irsee, Germany
- Thorsten Altenkirch, Wolfgang Naraschewski, Bernhard Reus:

Types for Proofs and Programs, International Workshop TYPES '98, Kloster Irsee, Germany, March 27-31, 1998, Selected Papers. Lecture Notes in Computer Science 1657, Springer 1999, ISBN 3-540-66537-4 - Peter Aczel:

On Relating Type Theories and Set Theories. 1-18 - René M. C. Ahn, Tijn Borghuis

:
Communication Modelling and Context-Dependent Interpretation: An Integrated Approach. 19-32 - Thierry Coquand, Henrik Persson:

Gröbner Bases in Type Theory. 33-46 - Joëlle Despeyroux, Pierre Leleu:

A Modal Lambda Calculus with Iteration and Case Constructs. 47-61 - Gilles Dowek, Benjamin Werner:

Proof Normalization Modulo. 62-77 - Jean-Christophe Filliâtre:

Proof of Imperative Programs in Type Theory. 78-92 - Daniel Fridlender:

An Interpretation of the Fan Theorem in Type Theory. 93-105 - Jean Goubault-Larrecq:

Conjunctive Types and SKInT. 106-120 - Florian Kammüller:

Modular Structures as Dependent Types in Isabelle. 121-132 - Thomas Kleymann:

Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter? 133-148 - Luigi Liquori:

Bounded Polymorphism for Extensible Objects. 149-163 - Maria Emilia Maietti:

About Effective Quotients in Constructive Type Theory. 164-178 - Frank Pfenning, Carsten Schürmann:

Algorithms for Equality and Unification in the Presence of Notational Definitions. 179-193 - Giovanni Sambin, Silvia Gebellato:

A Preview of the Basic Picture: A New Perspective on Formal Topology. 194-207

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














