Types for proofs and programs : international workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003 : revised selected papers
These proceedings contain a selection of refereed papers presented at or related to the 3rd Annual Workshop of the Types Working Group (Computer-Assisted Reasoning Based on Type Theory, EU IST project 29001), which was held d- ing April 30 to May 4, 2003, in Villa Gualino, Turin, Italy. The workshop...
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | , , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
3085 |
| Assuntos: | |
| Acesso em linha: | 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 2003, Torino, Italy, April 30 - May 4, 2003, revised selected papers, Stefano Berardi, Mario Coppo, Ferruccio Damiani (eds.), Berlin, Springer, 2004, 1 vol. (X-408 p.), Lecture notes in computer science, 3-540-22164-6 • Types for Proofs and Programs, Texte imprimé, 9783662213650 |
Sumário:
- A Modular Hierarchy of Logical Frameworks
- Tailoring Filter Models
- Locales and Locale Expressions in Isabelle/Isar
- to PAF!, a Proof Assistant for ML Programs Verification
- A Constructive Proof of Higman s Lemma in Isabelle
- A Core Calculus of Higher-Order Mixins and Classes
- Type Inference for Nested Self Types
- Inductive Families Need Not Store Their Indices
- Modules in Coq Are and Will Be Correct
- Rewriting Calculus with Fixpoints: Untyped and First-Order Systems
- First-Order Reasoning in the Calculus of Inductive Constructions
- Higher-Order Linear Ramified Recurrence
- Confluence and Strong Normalisation of the Generalised Multiary ?-Calculus
- Wellfounded Trees and Dependent Polynomial Functors
- Classical Proofs, Typed Processes, and Intersection Types
- Wave-Style Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models
- Coercions in Hindley-Milner Systems
- Combining Incoherent Coercions for ? -Types
- Induction and Co-induction in Sequent Calculus
- QArith: Coq Formalisation of Lazy Rational Arithmetic
- Mobility Types in Coq
- Some Algebraic Structures in Lambda-Calculus with Inductive Types
- A Concurrent Logical Framework: The Propositional Fragment
- Formal Proof Sketches
- Applied Type System.