Types for Proofs and Programs: Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (Paperback, 2003)
Brand newLOWEST PRICE
- £101.98Free P&P
- New condition
- Sold by grey_elk_books_au_and_uk
- See details for delivery est.
- £2.81Free P&P
- Very Good condition
- Sold by better_world_books_uk
- Est. delivery by 26 Dec
All listings for this product
Best-selling in Dictionaries & Reference
Save on Dictionaries & Reference
- £66.59Trending at £105.61
- £9.39Trending at £9.77
- £7.57Trending at £7.75
- £2.99Trending at £4.00
- £23.51Trending at £30.00
- £20.34Trending at £30.03
- £10.09Trending at £12.99
About this product
- PublisherSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Date of Publication28/04/2003
- GenreScience: General & Reference
- Series TitleLecture Notes in Computer Science
- Series Part/Volume Number2646
- Place of PublicationBerlin
- Country of PublicationGermany
- ImprintSpringer-Verlag Berlin and Heidelberg GmbH & Co. K
- Content NoteCCCXLIV, 336 p.
- Weight1070 g
- Width155 mm
- Height235 mm
- Edited byFreek Wiedijk,Herman Geuvers
- Edition Statement2003 ed.
- Table Of Contents(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-Lof'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.
This item doesn't belong on this page.
Thanks, we'll look into this.