Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Types for Proofs and Programs

International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Thorsten Altenkirch
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Conor McBride
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4502)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: TYPES 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (17 papers)

  1. Front Matter

    Download chapter PDF

  2. Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory

    • Robin Adams, Zhaohui Luo
    Pages 1-17

  3. Crafting a Proof Assistant

    • Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
    Pages 18-32

  4. On Constructive Cut Admissibility in Deduction Modulo

    • Richard Bonichon, Olivier Hermant
    Pages 33-47

  5. Fast Reflexive Arithmetic Tactics the Linear Case and Beyond

    • Frédéric Besson
    Pages 48-62

  6. Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq

    • Venanzio Capretta, Amy P. Felty
    Pages 63-77

  7. Deciding Equality in the Constructor Theory

    • Pierre Corbineau
    Pages 78-92

  8. A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family

    • Nils Anders Danielsson
    Pages 93-109

  9. Truth Values Algebras and Proof Normalization

    • Gilles Dowek
    Pages 110-124

  10. Curry-Style Types for Nominal Terms

    • Maribel Fernández, Murdoch J. Gabbay
    Pages 125-139

  11. (In)consistency of Extensions of Higher Order Logic and Type Theory

    • Herman Geuvers
    Pages 140-159

  12. Constructive Type Classes in Isabelle

    • Florian Haftmann, Makarius Wenzel
    Pages 160-174

  13. Zermelo’s Well-Ordering Theorem in Type Theory

    • Danko Ilik
    Pages 175-187

  14. A Finite First-Order Theory of Classes

    • Florent Kirchner
    Pages 188-202

  15. Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers

    • Milad Niqui
    Pages 203-220

  16. Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs

    • Hugo R. Simões, Kevin Hammond, Mário Florido, Pedro Vasconcelos
    Pages 221-236

  17. Subset Coercions in Coq

    • Matthieu Sozeau
    Pages 237-252

  18. A Certified Distributed Security Logic for Authorizing Code

    • Nathan Whitehead
    Pages 253-268

  19. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Types for Proofs and Programs

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation