Cantitate/Preț
Produs

Types for Proofs and Programs: International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers: Lecture Notes in Computer Science, cartea 4502

Editat de Thorsten Altenkirch, Conor McBride
en Limba Engleză Paperback – oct 2007

Din seria Lecture Notes in Computer Science

Preț: 31511 lei

Preț vechi: 39389 lei
-20% Nou

Puncte Express: 473

Preț estimativ în valută:
6033 6536$ 5038£

Carte tipărită la comandă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540744634
ISBN-10: 3540744630
Pagini: 277
Ilustrații: VIII, 272 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.42 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory.- Crafting a Proof Assistant.- On Constructive Cut Admissibility in Deduction Modulo.- Fast Reflexive Arithmetic Tactics the Linear Case and Beyond.- Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq.- Deciding Equality in the Constructor Theory.- A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family.- Truth Values Algebras and Proof Normalization.- Curry-Style Types for Nominal Terms.- (In)consistency of Extensions of Higher Order Logic and Type Theory.- Constructive Type Classes in Isabelle.- Zermelo’s Well-Ordering Theorem in Type Theory.- A Finite First-Order Theory of Classes.- Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers.- Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs.- Subset Coercions in Coq.- A Certified Distributed Security Logic for Authorizing Code.