Types for Proofs and Programs

Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers

AvHerman Geuvers,Freek Wiedijk

Häftad, Engelska, 2003

Del i serien Lecture Notes in Computer Science

535 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the thoroughly refereed post-proceedings of the Second International Workshop of the TYPES Working Group, TYPES 2002, held in Berg en Dal, The Netherlands in April 2002. The 18 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 Coq and Isar/HOL.

Produktinformation

Utgivningsdatum:2003-04-28
Mått:155 x 235 x 19 mm
Vikt:522 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:336
Upplaga:2003
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540140313

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT

Innehållsförteckning

(Co-)Iteration for Higher-Order Nested Datatypes.- Program Extraction in Simply-Typed Higher Order Logic.- General Recursion in Type Theory.- Using Theory Morphisms for Implementing Formal Methods Tools.- Subsets, Quotients and Partial Functions in Martin-Löf’s Type Theory.- Mathematical Quotients and Quotient Types in Coq.- A Constructive Formalization of the Fundamental Theorem of Calculus.- Two Behavioural Lambda Models.- A Unifying Approach to Recursive and Co-recursive Definitions.- Holes with Binding Power.- Typing with Conditions and Guarantees for Functional In-place Update.- A New Extraction for Coq.- Weak Transitivity in Coercive Subtyping.- The Not So Simple Proof-Irrelevant Model of CC.- Structured Proofs in Isar/HOL.- Java as a Functional Programming Language.- Monad Translating Inductive and Coinductive Types.- A Finite First-Order Presentation of Set Theory.