Skip to main content
SpringerLink
Log in

Types for Proofs and Programs

International Workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Stefano Berardi

    1. Dipartimento di Informatica, Università di Torino, Torino, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Mario Coppo

    1. Dipartimento di Informatica, Università di Torino,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Ferruccio Damiani

    1. Dipartimento di Informatica, Università di Torino, Torino, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3085)

Included in the following conference series:

Conference proceedings info: TYPES 2003.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (25 papers)

  1. Front Matter

    Download chapter PDF

  2. A Modular Hierarchy of Logical Frameworks

    • Robin Adams
    Pages 1-16

  3. Tailoring Filter Models

    • Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini
    Pages 17-33

  4. Locales and Locale Expressions in Isabelle/Isar

    • Clemens Ballarin
    Pages 34-50

  5. Introduction to PAF!, a Proof Assistant for ML Programs Verification

    • Sylvain Baro
    Pages 51-65

  6. A Constructive Proof of Higman’s Lemma in Isabelle

    • Stefan Berghofer
    Pages 66-82

  7. A Core Calculus of Higher-Order Mixins and Classes

    • Lorenzo Bettini, Viviana Bono, Silvia Likavec
    Pages 83-98

  8. Type Inference for Nested Self Types

    • Viviana Bono, Jerzy Tiuryn, Paweł Urzyczyn
    Pages 99-114

  9. Inductive Families Need Not Store Their Indices

    • Edwin Brady, Conor McBride, James McKinna
    Pages 115-129

  10. Modules in Coq Are and Will Be Correct

    • Jacek Chrza̧szcz
    Pages 130-146

  11. Rewriting Calculus with Fixpoints: Untyped and First-Order Systems

    • Horatiu Cirstea, Luigi Liquori, Benjamin Wack
    Pages 147-161

  12. First-Order Reasoning in the Calculus of Inductive Constructions

    • Pierre Corbineau
    Pages 162-177

  13. Higher-Order Linear Ramified Recurrence

    • Ugo Dal Lago, Simone Martini, Luca Roversi
    Pages 178-193

  14. Confluence and Strong Normalisation of the Generalised Multiary λ-Calculus

    • José Espírito Santo, Luís Pinto
    Pages 194-209

  15. Wellfounded Trees and Dependent Polynomial Functors

    • Nicola Gambino, Martin Hyland
    Pages 210-225

  16. Classical Proofs, Typed Processes, and Intersection Types

    • Silvia Ghilezan, Pierre Lescanne
    Pages 226-241

  17. “Wave-Style” Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models

    • Furio Honsell, Marina Lenisa
    Pages 242-258

  18. Coercions in Hindley-Milner Systems

    • Robert Kießling, Zhaohui Luo
    Pages 259-275

  19. Combining Incoherent Coercions for Σ -Types

    • Yong Luo, Zhaohui Luo
    Pages 276-292

  20. Induction and Co-induction in Sequent Calculus

    • Alberto Momigliano, Alwen Tiu
    Pages 293-308
Back to top

Other volumes

  1. Types for Proofs and Programs

Keywords

About this book

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 was attended by about 100 researchers. Out of 37 submitted papers, 25 were selected after a refereeing process. The ?nal choices were made by the editors. Two previous workshops of the Types Working Group under EU IST project 29001 were held in 2000 in Durham, UK, and in 2002 in Berg en Dal (close to Nijmegen), The Netherlands. These workshops followed a series of meetings organized in the period 1993–2002 within previous Types projects (ESPRIT BRA 6435 and ESPRIT Working Group 21900). The proceedings of these e- lier workshops were also published in the LNCS series, as volumes 806, 996, 1158, 1512, 1657, 2277, and 2646. ESPRIT BRA 6453 was a continuation of ESPRIT Action 3245, Logical Frameworks: Design, Implementation and Ex- riments. Proceedings for annual meetings under that action were published by Cambridge University Press in the books “Logical Frameworks”, and “Logical Environments”, edited by G. Huet and G. Plotkin. We are very grateful to the members of the research group “Semantics and Logics of Computation” of the Computer Science Department of the University of Turin, who helped organize the Types 2003 meeting in Torino.

Editors and Affiliations

  • Dipartimento di Informatica, Università di Torino, Torino, Italy

    Stefano Berardi, Ferruccio Damiani

  • Dipartimento di Informatica, Università di Torino,  

    Mario Coppo

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation