Types for Proofs and Programs
International Workshop TYPES '93, Nijmegen, The Netherlands, May 24 - 28, 1993. Selected Papers
Published on 20. May 1994
Book
Paperback/Softback
IX, 395 pages
978-3-540-58085-0 (ISBN)
Description
This volume contains thoroughly refereed and revised full papers selected from the presentations at the first workshop held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs in Nijmegen, The Netherlands, in May 1993.
As the whole ESPRIT BRA 6453, this volume is devoted to the theoretical foundations, design and applications of systems for theory development. Such systems help in designing mathematical axiomatisation, performing computer-aided logical reasoning, and managing databases of mathematical facts; they are also known as proof assistants or proof checkers.
As the whole ESPRIT BRA 6453, this volume is devoted to the theoretical foundations, design and applications of systems for theory development. Such systems help in designing mathematical axiomatisation, performing computer-aided logical reasoning, and managing databases of mathematical facts; they are also known as proof assistants or proof checkers.
More details
Series
Edition
1994 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
IX, 395 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 22 mm
Weight
610 gr
ISBN-13
978-3-540-58085-0 (9783540580850)
DOI
10.1007/3-540-58085-9
Schweitzer Classification
Persons
Content
Proving strong normalization of CC by modifying realizability semantics.- Checking algorithms for Pure Type Systems.- Infinite objects in type theory.- Conservativity between logics and typed ? calculi.- Logic of refinement types.- Proof-checking a data link protocol.- Elimination of extensionality in Martin-Löf type theory.- Programming with streams in Coq a case study: The Sieve of Eratosthenes.- The Alf proof editor and its proof engine.- Encoding Z-style Schemas in type theory.- The expressive power of Structural Operational Semantics with explicit assumptions.- Developing certified programs in the system Coq the program tactic.- Closure under alpha-conversion.- Machine Deduction.- Type theory and the informal language of mathematics.- Semantics for abstract clauses.