Adapting proofs-as-programs

Iman Hafiz Poernomo

at 250 WPM

7 hours

The average reader, reading at a speed of 250 WPM, would take 7 hours to read Adapting proofs-as-programs.

Personalise your estimate by entering your reading speed below

Test my reading speed

14

days at 30 min/day

420

total minutes

Buy on Amazon

Adapting proofs-as-programs

by Iman Hafiz Poernomo, Martin Wirsing

June 21, 2005

Springer

420

9780387237596

0387237593

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.

Frequently Asked Questions

How many pages are in Adapting proofs-as-programs?

This edition of Adapting proofs-as-programs has approximately 420 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.

How long does it take to read Adapting proofs-as-programs?

For most readers, Adapting proofs-as-programs typically takes between 8h 45m and 5h 50m to complete. This is based on the book's length of approximately 105,000 words and common reading speeds.

Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 7h 0m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 14 days • Estimated word count: 105,000 words

Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.

What is the word count of Adapting proofs-as-programs?

The estimated word count for Adapting proofs-as-programs is approximately 105,000 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.

This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.

Who is the author of Adapting proofs-as-programs?

Adapting proofs-as-programs was written by Iman Hafiz Poernomo, Martin Wirsing.

When was Adapting proofs-as-programs published?

The publication date for this specific edition is June 21, 2005. The original work may have been published on a different date.