Types for Proofs and Programs

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

Häftad, Engelska, 2004

Av Stefano Berardi, Mario Coppo, Ferruccio Damiani

729 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2004-06-15
Mått155 x 235 x 23 mm
Vikt639 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor412
Upplaga2004
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540221647

Tillhör följande kategorier

Programspråk inom Data och it
Programmeringsböcker inom Data och it
Systemvetenskap och AI inom Data och it
Artificiell intelligens inom Data och it

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.