Blick ins Buch

Types for Proofs and Programs

International Workshop TYPES '93, Nijmegen, The Netherlands, May 24 - 28, 1993. Selected Papers

Henk Barendregt, Tobias Nipkow (Herausgeber)

Buch | Softcover

IX, 395 Seiten

1994
Springer Berlin (Verlag)
978-3-540-58085-0 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

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.

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.

Erscheint lt. Verlag	20.5.1994
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	IX, 395 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 233 mm
Gewicht	529 g
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	Automatisches Beweisverfahren • Beweisprüfung • Compiler • Databases • formale Sprachen • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • HC/Informatik, EDV/Programmiersprachen • Kalkül • Lambda-Calculus • Lambda-Kalkül • linear optimization • logical reasoning • Machine Deduction • Maschinelles Schließen • Programmiersprache • Programmierung • proof checking • Systematisches Beweisen • theorem proving • Typentheorie • Types
ISBN-10	3-540-58085-9 / 3540580859
ISBN-13	978-3-540-58085-0 / 9783540580850
Zustand	Neuware