Types for Proofs and Programs
Springer Berlin (Verlag)
978-3-540-74463-4 (ISBN)
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.
Erscheint lt. Verlag | 1.10.2007 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | VIII, 272 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 408 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
Informatik ► Theorie / Studium ► Compilerbau | |
Schlagworte | algorithms • formal methods • Formal Reasoning • formal specification • Formal Verification • Functional Programming • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Higher Order Logic • Isabell • Isabelle • Logic • Polymorphism • programming • Programming language • Programming Logic • Programming Theory • Program Semantics • Proof theory • Rewriting Systems • subtyping • theorem proving • type inference • Types • Type Systems • verification |
ISBN-10 | 3-540-74463-0 / 3540744630 |
ISBN-13 | 978-3-540-74463-4 / 9783540744634 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich