TYPES 1994:
Båstad, Sweden
Peter Dybjer, Bengt Nordström, Jan M. Smith (Eds.):
Types for Proofs and Programs, International Workshop TYPES'94, Båstad, Sweden, June 6-10, 1994, Selected Papers.
Lecture Notes in Computer Science 996 Springer 1995, ISBN 3-540-60579-7 
- René M. C. Ahn:
Communication Contexts: a Pragmatic Approach to Information Exchange.
1-13
- Herman Geuvers:
A short and flexible proof of Strong Normalization for the Calculus of Constructions.
14-38
- Eduardo Giménez:
Codifying Guarded Definitions with Recursive Schemes.
39-59
- Healfdene Goguen:
The Metatheory of UTT.
60-82
- Pascal Manoury:
A User's Friendly Syntax to Define Recursive Functions as Typed lambda-Terms.
83-100
- Tobias Nipkow, Konrad Slind:
I/Q Automata in Isabelle/HOL.
101-119
- Lawrence C. Paulson:
A Concrete Final Coalgebra Theorem for ZF Set Theory.
120-139
- Robert Pollack:
On Extensibility of Proof Checkers.
140-161
- Aarne Ranta:
Syntactic Categories in the Language of Mathematics.
162-182
- Amokrane Saïbi:
Formalization of a lamda-Calculus with Explicit Substitutions in Coq.
183-202
Last update Wed May 22 16:44:43 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
