TYPES 2002: Berg en Dal, The Netherlands
Herman Geuvers, Freek Wiedijk (Eds.): Types for Proofs and Programs, Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers. Springer 2003 Lecture Notes in Computer Science ISBN 3-540-14031-X- Stefan Berghofer: Program Extraction in Simply-Typed Higher Order Logic. 21-38
- Ana Bove: General Recursion in Type Theory. 39-58
- Achim D. Brucker, Burkhart Wolff: Using Theory Morphisms for Implementing Formal Methods Tools. 59-77
- Jesper Carlström: Subsets, Quotients and Partial Functions in Martin-Löf's Type Theory. 78-94
- Laurent Chicli, Loic Pottier, Carlos Simpson: Mathematical Quotients and Quotient Types in Coq. 95-107
- Luís Cruz-Filipe: A Constructive Formalization of the Fundamental Theorem of Calculus. 108-126
- Pietro Di Gianantonio, Marino Miculan: A Unifying Approach to Recursive and Co-recursive Definitions. 148-161
- Gueorgui I. Jojgov: Holes with Binding Power. 162-181
- Michal Konecný: Typing with Conditions and Guarantees for Functional In-place Update. 182-199
- Pierre Letouzey: A New Extraction for Coq. 200-219
- Tobias Nipkow: Structured Proofs in Isar/HOL. 259-278
- Anton Setzer: Java as a Functional Programming Language. 279-298
- Tarmo Uustalu: Monad Translating Inductive and Coinductive Types. 299-315
- Stéphane Vaillant: A Finite First-Order Presentation of Set Theory. 316-330
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team