Types for Proofs and Programs

International Workshop TYPES '94, Bastad, Sweden, June 6-10, 1994. Selected Papers
1995
ISBN: 978-3-540-60579-9
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 996, 210 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 341 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Dybjer, Peter

Smith, Jan

Nordström, Bengt

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines

Inhaltsverzeichnis

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.