Types for Proofs and Programs: International Workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers / Edition 1

Types for Proofs and Programs: International Workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers / Edition 1

by Stefano Berardi
     
 

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop of the Types Working Group, TYPES 2003, held in Torino, Italy in April/May 2003. The 25 revised full papers presented were carefully selected during two rounds of reviewing and improvement. All current issues in type theory and type systems and their applications to

See more details below

Overview

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop of the Types Working Group, TYPES 2003, held in Torino, Italy in April/May 2003. The 25 revised full papers presented were carefully selected during two rounds of reviewing and improvement. All current issues in type theory and type systems and their applications to programming, systems design, and proof theory are addressed. Among the systems dealt with are Isabelle/Isar, PAF!, and Coq.

Product Details

ISBN-13:
9783540221647
Publisher:
Springer Berlin Heidelberg
Publication date:
08/05/2004
Series:
Lecture Notes in Computer Science Series, #3085
Edition description:
2004
Pages:
412
Product dimensions:
9.21(w) x 6.14(h) x 0.87(d)

Table of Contents

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.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >