Central Library

Normal view MARC view ISBD view

Types for Proofs and Programs [electronic resource] : International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers / edited by Thorsten Altenkirch, Conor McBride.

Contributor(s): Altenkirch, Thorsten [editor.] | McBride, Conor [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 4502Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007.Description: VIII, 272 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540744641.Subject(s): Compilers (Computer programs) | Computer science | Machine theory | Computer science -- Mathematics | Artificial intelligence | Compilers and Interpreters | Computer Science Logic and Foundations of Programming | Formal Languages and Automata Theory | Symbolic and Algebraic Manipulation | Artificial IntelligenceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.45 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.