Types for Proofs and Programs

Specification and Verification of a Formal System for Structurally Recursive Functions.- A Predicative Strong Normalisation Proof for a ?Calculus with Interleaving Inductive Types.- Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and ?-Rule.- Computer-Assisted Mathematics at Work.- Specification of a Smart Card Operating System.- Implementation Techniques for Inductive Types in Plastic.- A Co-inductive Approach to Real Numbers.- Information Retrieval in a Coq Proof Library Using Type Isomorphisms.- Memory Management: An Abstract Formulation of Incremental Tracing.- The Three Gap Theorem (Steinhaus Conjecture).- Formalising Formulas-as-Types-as-Objects.

Includes supplementary material: sn.pub/extras