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.
Lecture Notes in Computer Science 2646 Springer 2003, ISBN 3-540-14031-X 
- Andreas Abel, Ralph Matthes:
(Co-)Iteration for Higher-Order Nested Datatypes.
1-20
- 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
- Mariangiola Dezani-Ciancaglini, Silvia Ghilezan:
Two Behavioural Lambda Models.
127-147
- 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
- Yong Luo, Zhaohui Luo, Sergei Soloviev:
Weak Transitivity in Coercive Subtyping.
220-239
- Alexandre Miquel, Benjamin Werner:
The Not So Simple Proof-Irrelevant Model of CC.
240-258
- 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
Last update Thu May 23 18:03:36 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
