Certified Programs and Proofs, Georges Gonthier; Michael Norrish

Автор: Stefano Berardi; Ferruccio Damiani; Ugo de Liguoro
Название: Types for Proofs and Programs
ISBN: 3642024432 ISBN-13(EAN): 9783642024436
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These proceedings contain a selection of refereed papers presented at or - lated to the Annual Workshop of the TYPES project (EU coordination action 510996), which was held during March 26-29, 2008 in Turin, Italy.

Автор: Richard J. Lipton; Kenneth W. Regan
Название: People, Problems, and Proofs
ISBN: 3662523019 ISBN-13(EAN): 9783662523018
Издательство: Springer
Рейтинг:
Цена: 41920.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book offers insights into theoretical computer science and mathematics, distilling complex topics into manageable essays that summarize and explain key developments, historical context, and future directions of complexity, computability and algorithms.

Автор: Chris Hawblitzel; Dale Miller
Название: Certified Programs and Proofs
ISBN: 364235307X ISBN-13(EAN): 9783642353079
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the Second International Conference on Certified Programs and Proofs, CPP 2012, held in Kyoto, Japan, in December 2012. They deal with those topics in computer science and mathematics in which certification via formal techniques is crucial.

Автор: Henk Barendregt; Tobias Nipkow
Название: Types for Proofs and Programs
ISBN: 3540580859 ISBN-13(EAN): 9783540580850
Издательство: Springer
Рейтинг:
Цена: 74530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains research papers devoted to the theoretical foundations, design and application of computer systems for theory development. Such systems help to design mathematical axiomatization, perform computer-aided logical reasoning and manage databases of mathematical facts.

Автор: Lutz Pl?mer
Название: Termination Proofs for Logic Programs
ISBN: 3540528377 ISBN-13(EAN): 9783540528371
Издательство: Springer
Рейтинг:
Цена: 55890.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Termination proofs constitute a crucial part of program verification. Although logic programs pose special difficulties for termination proofs it turns out that automation of this task is obtainable to a much larger degree than for programs in imperative languages.

Автор: Paul Callaghan; Zhaohui Luo; James McKinna; Robert
Название: Types for Proofs and Programs
ISBN: 3540432876 ISBN-13(EAN): 9783540432876
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text contains the post-proceedings of the International Workshop of the TYPES Working Group held in Durham in December 2000. The 15 revised full papers address significant issues on type theory and type systems and their applications to programming, systems design and proof theory.

Автор: Thierry Coquand; Peter Dybjer; Bengt Nordstr?m; Ja
Название: Types for Proofs and Programs
ISBN: 3540415173 ISBN-13(EAN): 9783540415176
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This work constitutes the post-workshop proceedings of the Third International Workshop, TYPES`99, organized by the ESPRIT Working Group 21900, in Lokeberg, Sweden, in June 1999. Issues on type theory and type systems and their applications to programming and proof theory are addressed.

Автор: Thorsten Altenkirch; Conor McBride
Название: Types for Proofs and Programs
ISBN: 3540744630 ISBN-13(EAN): 9783540744634
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed post-proceedings of the annual International Workshop of the Types Working Group, TYPES 2006, held in Nottingham, UK in April 2006 - co-located with the Seventh Symposium on Trends in Functional Programming, TFP 2006. This book presents 17 revised full papers that were reviewed and selected from 29 submissions.

Автор: Jean-Christophe Filliatre; Christine Paulin-Mohrin
Название: Types for Proofs and Programs
ISBN: 3540314288 ISBN-13(EAN): 9783540314288
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The 17 revised full papers presented here cover all current issues of formal reasoning and computer programming based on type theory are addressed; in particular languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education.

Автор: Fernando Ferreira; Benedikt L?we; Elvira Mayordomo
Название: Programs, Proofs, Processes
ISBN: 3642139612 ISBN-13(EAN): 9783642139611
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 6th Conference on Computability in Europe, CiE 2010, held in Ponta Delgada, Azores, Portugal, in June/July 2010.

Автор: Thorsten Altenkirch; Wolfgang Naraschewski; Bernha
Название: Types for Proofs and Programs
ISBN: 3540665374 ISBN-13(EAN): 9783540665373
Издательство: Springer
Рейтинг:
Цена: 55890.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text constitutes the refereed post-workshop proceedings of the International Workshop on Types for Proofs and Programs, TYPES `98. A variety of aspects of type theory and type systems and their relation to proof theory are addressed.

Автор: Gilles Dowek
Название: Proofs and Algorithms: Introduction to Logic and Computability Theory
ISBN: 0857291203 ISBN-13(EAN): 9780857291202
Издательство: Springer
Рейтинг:
Цена: 32560.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, G?del’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.