Types for Proofs and Programs
Editat de Herman Geuvers, Freek Wiedijken Limba Engleză Paperback – 28 apr 2003
Preț: 323.41 lei
Preț vechi: 404.26 lei
-20% Nou
Puncte Express: 485
Preț estimativ în valută:
57.23€ • 66.74$ • 50.25£
57.23€ • 66.74$ • 50.25£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540140313
ISBN-10: 354014031X
Pagini: 344
Ilustrații: CCCXLIV, 336 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354014031X
Pagini: 344
Ilustrații: CCCXLIV, 336 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
(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.