Types for proofs and programs : international workshop, TYPES 2002, Berg en Dal, the Netherlands, April 24-28, 2002 : selected papers / Herman Geuvers, Freek Wiedijk, eds.
Material type:
TextSeries: Lecture notes in computer science ; 2646.Publication details: Berlin ; Hong Kong : Springer, ©2003.Description: 1 online resource (viii, 330 pages) : illustrationsContent type: - text
- computer
- online resource
- 9783540391852
- 3540391851
- 005.1 21
- QA76.9.A96
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
eBook
|
e-Library | eBook LNCS | Available |
Includes bibliographical references.
Screen of 2005-03-01; title from caption.
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.
(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.