Cantitate/Preț
Produs
Total produse
Vezi coșul
Types for Proofs and Programs de Stefano Berardi

Types for Proofs and Programs

Editat de Stefano Berardi, Mario Coppo
en Limba Engleză Paperback – 2 oct 1996
This volume contains a refereed selection of revised full papers chosen from the contributions presented during the Third Annual Workshop held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs. The workshop took place in Torino, Italy, in June 1995.
Type theory is a formalism in which theorems and proofs, specifications and programs can be represented in a uniform way. The 19 papers included in the book deal with foundations of type theory, logical frameworks, and implementations and applications; all in all they constitute a state-of-the-art survey for the area of type theory.
Citește tot Restrânge

Preț: 32280 lei

Preț vechi: 40350 lei
-20%

Puncte Express: 484

Carte tipărită la comandă

Livrare economică 08-22 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540617808
ISBN-10: 3540617809
Pagini: 312
Ilustrații: X, 298 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.48 kg
Ediția:1996
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Implicit coercions in type systems.- A two-level approach towards lean proof-checking.- The greatest common divisor: A case study for program extraction from classical proofs.- Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids.- A constructive proof of the Heine-Borel covering theorem for formal reals.- An application of constructive completeness.- Automating inversion of inductive predicates in Coq.- First order marked types.- Internal type theory.- An application of co-inductive types in Coq: Verification of the alternating bit protocol.- Conservativity of equality reflection over intensional type theory.- A natural deduction approach to dynamic logic.- An algorithm for checking incomplete proof objects in type theory with localization and unification.- Decidability of all minimal models.- Circuits as streams in Coq: Verification of a sequential multiplier.- Context-relative syntactic categories and the formalization of mathematical text.- A simple model construction for the Calculus of Constructions.- Optimized encodings of fragments of type theory in first order logic.- Organization and development of a constructive axiomatization.