Types for Proofs and Programs - International Workshop TYPES '94, Bastad, Sweden, June 6-10, 1994. Selected Papers

This book presents a strictly refereed collection of revised full papers selected from the papers accepted for the TYPES '94 Workshop, held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs in Bastad, Sweden, in June 1994.
The 10 papers included address various aspects of developing computer-assisted proofs and programs using a logical framework. Type theory and three logical frameworks based on it are dealt with: ALF, Coq, and LEGO; other topics covered are metatheory, the Isabelle system, 2-calculus, proof checkers, and ZF set theory.

List of contents

Communicating contexts: A pragmatic approach to information exchange.- A short and flexible proof of strong normalization for the calculus of constructions.- Codifying guarded definitions with recursive schemes.- The metatheory of UTT.- A user's friendly syntax to define recursive functions as typed ?-terms.- I/O automata in Isabelle/HOL.- A concrete final coalgebra theorem for ZF set theory.- On extensibility of proof checkers.- Syntactic categories in the language of mathematics.- Formalization of a ?-calculus with explicit substitutions in Coq.

Product details

• Assisted by: Peter Dybjer (Editor), Bengt Nordstr¿m (Editor), Beng Nordström (Editor), Bengt Nordström (Editor), Jan Smith (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 22.10.2002
• EAN: 9783540605799
• ISBN: 978-3-540-60579-9
• No. of pages: 210
• Weight: 294 g
• Illustrations: X, 210 p.
• Series: Lecture Notes in Computer Science; Lecture Notes in Computer Science
• Subject: Natural sciences, medicine, IT, technology > IT, data processing > IT