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.
Author(s): Robin Adams (auth.), Stefano Berardi, Mario Coppo, Ferruccio Damiani (eds.)
Series: Lecture Notes in Computer Science 3085
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2004
Language: English
Pages: 412
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics)
Front Matter....Pages -
A Modular Hierarchy of Logical Frameworks....Pages 1-16
Tailoring Filter Models....Pages 17-33
Locales and Locale Expressions in Isabelle/Isar....Pages 34-50
Introduction to PAF!, a Proof Assistant for ML Programs Verification....Pages 51-65
A Constructive Proof of Higman’s Lemma in Isabelle....Pages 66-82
A Core Calculus of Higher-Order Mixins and Classes....Pages 83-98
Type Inference for Nested Self Types....Pages 99-114
Inductive Families Need Not Store Their Indices....Pages 115-129
Modules in Coq Are and Will Be Correct....Pages 130-146
Rewriting Calculus with Fixpoints: Untyped and First-Order Systems....Pages 147-161
First-Order Reasoning in the Calculus of Inductive Constructions....Pages 162-177
Higher-Order Linear Ramified Recurrence....Pages 178-193
Confluence and Strong Normalisation of the Generalised Multiary λ -Calculus....Pages 194-209
Wellfounded Trees and Dependent Polynomial Functors....Pages 210-225
Classical Proofs, Typed Processes, and Intersection Types....Pages 226-241
“Wave-Style” Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models....Pages 242-258
Coercions in Hindley-Milner Systems....Pages 259-275
Combining Incoherent Coercions for Σ -Types....Pages 276-292
Induction and Co-induction in Sequent Calculus....Pages 293-308
QArith: Coq Formalisation of Lazy Rational Arithmetic....Pages 309-323
Mobility Types in Coq....Pages 324-337
Some Algebraic Structures in Lambda-Calculus with Inductive Types....Pages 338-354
A Concurrent Logical Framework: The Propositional Fragment....Pages 355-377
Formal Proof Sketches....Pages 378-393
Applied Type System....Pages 394-408
Back Matter....Pages -
