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

Types for Proofs and Programs: International Workshop TYPES '94, Bastad, Sweden, June 6-10, 1994…

EditorPeter Dybjer

Paperback | October 18, 1995

Pricing and Purchase Info

$104.20 online 
$116.95 list price save 10%
Earn 521 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Types for Proofs and Programs: International Workshop TYPES '94, Bastad, Sweden, June 6-10, 1994…Format:PaperbackDimensions:220 pagesPublished:October 18, 1995Publisher:Springer Berlin Heidelberg

The following ISBNs are associated with this title:

ISBN - 10:3540605797

ISBN - 13:9783540605799

Look for similar items by category:

Reviews

Table 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.