Cantitate/Preț
Produs

Types for Proofs and Programs: International Workshop TYPES '93, Nijmegen, The Netherlands, May 24 - 28, 1993. Selected Papers: Lecture Notes in Computer Science, cartea 806

Editat de Henk Barendregt, Tobias Nipkow
en Limba Engleză Paperback – 20 mai 1994
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32821 lei

Preț vechi: 41027 lei
-20% Nou

Puncte Express: 492

Preț estimativ în valută:
6282 6547$ 5229£

Carte tipărită la comandă

Livrare economică 04-18 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540580850
ISBN-10: 3540580859
Pagini: 404
Ilustrații: IX, 395 p.
Dimensiuni: 155 x 233 x 21 mm
Greutate: 0.57 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.