Types for proofs and programs : International Workshop TYPES 96 Aussois, France, December 15 19, 1996 : selected papers
This book constitutes the thoroughly revised post-workshop proceedings of the first annual workshop held under the auspices of the ESPRIT Working Group 21900 TYPES in Aussois, France in December 1996. The 18 revised full papers presented in the book were carefully reviewed and selected from the 30 p...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
1512 |
| Fag: | |
| Online adgang: | Acce s sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
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 '96, Aussois, France, December 1996, selected papers, Eduardo Giménez, Christine Paulin-Mohring (eds.), 1998, Berlin, Springer, 1 vol. (VIII-372 p.), Lecture notes in computer science, 3-540-65137-3 • Types for Proofs and Programs, Texte imprimé, 9783662200575 |
Indholdsfortegnelse:
- Coercion synthesis in computer implementations of type-theoretic frameworks
- Verification of the interface of a small proof system in coq
- An implementation of the Heine-Borel covering theorem in type theory
- Detecting and removing dead-code using rank 2 intersection
- A type-free formalization of mathematics where proofs are objects
- Higman's lemma in type theory
- A proof of weak termination of typed ??-calculi
- Proof style
- Some algorithmic and proof-theoretical aspects of coercive subtyping
- Semantical BNF
- The internal type theory of a Heyting pretopos
- Inverting inductively defined relations in LEGO
- A generic normalisation proof for pure type systems
- Proving a real time algorithm for ATM in Coq
- Dependent types with explicit substitutions: A meta-theoretical development
- Type inference verified: Algorithm W in Isabelle/HOL
- Continuous lattices in formal topology
- Abstract insertion sort in an extension of type theory with record types and subtyping.