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.
Author(s): René Ahn (auth.), Peter Dybjer, Bengt Nordström, Jan Smith (eds.)
Series: Lecture Notes in Computer Science 996
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995
Language: English
Commentary: (add ocr)
Pages: 210
Tags: Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations
Communicating contexts: A pragmatic approach to information exchange....Pages 1-13
A short and flexible proof of strong normalization for the calculus of constructions....Pages 14-38
Codifying guarded definitions with recursive schemes....Pages 39-59
The metatheory of UTT ....Pages 60-82
A user's friendly syntax to define recursive functions as typed λ-terms....Pages 83-100
I/O automata in Isabelle/HOL....Pages 101-119
A concrete final coalgebra theorem for ZF set theory....Pages 120-139
On extensibility of proof checkers....Pages 140-161
Syntactic categories in the language of mathematics....Pages 162-182
Formalization of a λ-calculus with explicit substitutions in Coq....Pages 183-202
