product iamge

Types for Proofs and Programs: International Workshop, TYPES’99 Lökeberg, Sweden, June 12–16, 1999 Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the thoroughly refereed post-workshop proceedings of the Third International Workshop, TYPES'99, organized by the ESPRIT Working Group 21900, in L?keberg, Sweden, in June 1999.
The 11 revised full papers presented in the volume were carefully reviewed and selected during two rounds of refereeing. All current issues on type theory and type systems and their applications to programming and proof theory are addressed.

Author(s): Andreas Abel (auth.), Thierry Coquand, Peter Dybjer, Bengt Nordström, Jan Smith (eds.)
Series: Lecture Notes in Computer Science 1956
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000

Language: English
Pages: 197
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations

Specification and Verification of a Formal System for Structurally Recursive Functions....Pages 1-20
A Predicative Strong Normalisation Proof for a λCalculus with Interleaving Inductive Types....Pages 21-40
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and β-Rule....Pages 41-60
Computer-Assisted Mathematics at Work....Pages 61-76
Specification of a Smart Card Operating System....Pages 77-93
Implementation Techniques for Inductive Types in Plastic....Pages 94-113
A Co-inductive Approach to Real Numbers....Pages 114-130
Information Retrieval in a Coq Proof Library Using Type Isomorphisms....Pages 131-147
Memory Management: An Abstract Formulation of Incremental Tracing....Pages 148-161
The Three Gap Theorem (Steinhaus Conjecture)....Pages 162-173
Formalising Formulas-as-Types-as-Objects....Pages 174-193