Adapting Proofs-as-Programs
The Curry-Howard Protocol (Monographs in Computer Science)
Our rough guess is there are 105,000 words in this book.
At a pace averaging 250 words per minute, this book will take 7 hours and 0 minutes to read. With a half hour per day, this will take 14 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Publication
2005-06-21 - Springer
Language
English
Word Count
105,000 words, Guess
Page Count
420 pages
Identifiers
- Open LibraryOL7444579M
- ISBN-139780387237596
- ISBN-100387237593
- OCLC Control Number58478542
- OCLC Control Numberadaptingproofsas00poer
and 3 more
- Library of Congress Control Number2005046411
- LibraryThing2623395
- Goodreads879480
Classifications
- LCCQA9.54 .P64 2005
Description
This book ?nds new things to do with an old idea. The proofs-as-programs paradigm constitutes a set of approaches to developing programs from proofs in constructive logic. It has been over thirty years since the paradigm was ?rst conceived. At that time, there was a belief that proofs-as-programs had the - tential for practical application to semi-automated software development. I- tial applications were mostly concerned with ?ne-grain, mathematical program synthesis. For various reasons, research interest in the area eventually tended toward more theoretic issues of constructive logic and type theory. However, in recent years, the situation has become more balanced, and there is increasingly active research in applying constructive techniques to industrial-scale, complex software engineering problems. Thismonographdetailsseveralimportantadvancesinthisdirectionofpr- tical proofs-as-programs. One of the central themes of the book is a general, abstract framework for developing new systems of program synthesis by adapting proofs-as-programs to new contexts. Framework-oriented approaches that facilitate analogous - proaches to building systems for solving particular problems have been popular and successful. Thesemethodsarehelpful asthey providea formal toolbox that enablesa“roll-your-own”approachtodevelopingsolutions.Itishopedthatour framework will have a similar impact. The framework is demonstrated by example. We will give two novel - plications of proofs-as-programs to large-scale, coarse-grain software engine- ing problems: contractual imperative program synthesis and structured p- gram synthesis. These applications constitute an exemplary justi?cation of the framework. Also, in and of themselves, these approaches to synthesis should be interesting for researchers working in the target problem domains.
First Sentence
Ultimately, software developers would like to solve problems by building well-structured, comprehensible, correct programs, solely through the application of domain knowledge.
Subjects
Topics
Similar Books
Foundations of Algebraic Specification and Formal Software Development
by Donald Sannella, Andrzej Tarlecki
Logical Foundations of Computer Science: International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings
edited by Sergei Artemov, Anil Nerode
Formal Aspects of Component Software: 8th International Symposium, FACS 2011, Oslo, Norway, September 14-16, 2011, Revised Selected Papers
edited by Farhad Arbab, Peter Csaba Ölveczky
Reliable Software Technologies - Ada-Europe 2011: 16th Ada-Europe International Conference on Reliable Software Technologies, Edinburgh, UK, June 20-24, 2011. Proceedings
edited by Alexander Romanovsky, Tullio Vardanega
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!