Types for proofs and programs : International Workshop TYPES '94 Båstad, Sweden, June 6 10, 1994 : selected papers
This book presents a strictly refereed collection of revised full papers selected from the papers accepted for the TYPES '94 Workshop, held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs in Bastad, Sweden, in June 1994. The 10 papers included address v...
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
996 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Types for proofs and programs, International Workshop TYPES '94, Båstad, Sweden, June 6-10, 1994, selected papers, Peter Dybjer, Bengt Nordström, Jan Smith, eds, Berlin, Springer, 1995, 1 vol. (X-202 p.), Lecture notes in computer science, 3-540-60579-7 • Types for Proofs and Programs, Texte imprimé, 9783662188460 |
Tabla de Contenidos:
- Communicating contexts: A pragmatic approach to information exchange
- A short and flexible proof of strong normalization for the calculus of constructions
- Codifying guarded definitions with recursive schemes
- The metatheory of UTT
- A user's friendly syntax to define recursive functions as typed ?-terms
- I/O automata in Isabelle/HOL
- A concrete final coalgebra theorem for ZF set theory
- On extensibility of proof checkers
- Syntactic categories in the language of mathematics
- Formalization of a ?-calculus with explicit substitutions in Coq.