Book Description
"The third novel in Terry Pratchett and Stephen Baxter's "Long Earth" series, which Io9 calls "a brilliant science fiction collaboration.""--
Author : Jacobus Willem Bakker
Publisher : Prentice Hall
Page : 536 pages
File Size : 26,7 MB
Release : 1980
Category : Computers
ISBN :
"The third novel in Terry Pratchett and Stephen Baxter's "Long Earth" series, which Io9 calls "a brilliant science fiction collaboration.""--
Author : Jacobus Willem de Bakker
Publisher :
Page : 0 pages
File Size : 34,57 MB
Release : 1980
Category :
ISBN :
Author : Jaco De Bakker
Publisher :
Page : 505 pages
File Size : 10,56 MB
Release : 1980
Category :
ISBN :
Author : 伊藤貴康
Publisher : 株式会社 三恵社
Page : 320 pages
File Size : 37,58 MB
Release : 2010-10
Category :
ISBN : 9784883617838
Author : J. R. Gabriel
Publisher :
Page : 14 pages
File Size : 11,15 MB
Release : 1987
Category :
ISBN :
Author : 伊藤貴康
Publisher : 株式会社 三恵社
Page : 176 pages
File Size : 24,67 MB
Release : 2011-04
Category :
ISBN : 9784883618583
Author : Zohar Manna
Publisher : Courier Dover Publications
Page : 0 pages
File Size : 35,51 MB
Release : 2003
Category : Computers
ISBN : 9780486432380
With the objective of making into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects of the process. A classic of sequential program verification, this volume has been translated into almost a dozen other languages and is much in demand among graduate and advanced undergraduate computer science students. Subjects include computability (with discussions of finite automata and Turing machines); predicate calculus (basic notions, natural deduction, and the resolution method); verification of programs (both flowchart and algol-like programs); flowchart schemas (basic notions, decision problems, formalization in predicate calculus, and translation programs); and the fixpoint theory of programs (functions and functionals, recursive programs, and verification programs). The treamtent is self-contained, and each chapter concludes with bibliographic remarks, references, and problems.
Author : Michael Main
Publisher : Springer Science & Business Media
Page : 652 pages
File Size : 27,70 MB
Release : 1988-03-09
Category : Mathematics
ISBN : 9783540190202
This volume is the proceedings of the 3rd Workshop on the Mathematical Foundations of Programming Language Semantics held at Tulane University, New Orleans, Louisiana, April 8-10, 1987. The 1st Workshop was at Kansas State University, Manhattan, Kansas in April, 1985 (see LNCS 239), and the 2nd Workshop with a limited number of participants was at Kansas State in April, 1986. It was the intention of the organizers that the 3rd Workshop survey as many areas of the Mathematical Foundations of Programming Language Semantics as reasonably possible. The Workshop attracted 49 submitted papers, from which 28 papers were chosen for presentation. The papers ranged in subject from category theory and Lambda-calculus to the structure theory of domains and power domains, to implementation issues surrounding semantics.
Author : T. Streicher
Publisher : Springer Science & Business Media
Page : 312 pages
File Size : 16,75 MB
Release : 2012-12-06
Category : Computers
ISBN : 146120433X
Typing plays an important role in software development. Types can be consid ered as weak specifications of programs and checking that a program is of a certain type provides a verification that a program satisfies such a weak speci fication. By translating a problem specification into a proposition in constructive logic, one can go one step further: the effectiveness and unifonnity of a con structive proof allows us to extract a program from a proof of this proposition. Thus by the "proposition-as-types" paradigm one obtains types whose elements are considered as proofs. Each of these proofs contains a program correct w.r.t. the given problem specification. This opens the way for a coherent approach to the derivation of provably correct programs. These features have led to a "typeful" programming style where the classi cal typing concepts such as records or (static) arrays are enhanced by polymor phic and dependent types in such a way that the types themselves get a complex mathematical structure. Systems such as Coquand and Huet's Calculus of Con structions are calculi for computing within extended type systems and provide a basis for a deduction oriented mathematical foundation of programming. On the other hand, the computational power and the expressive (impred icativity !) of these systems makes it difficult to define appropriate semantics.
Author : Jacob T. Schwartz
Publisher : Springer Science & Business Media
Page : 426 pages
File Size : 22,26 MB
Release : 2011-07-16
Category : Computers
ISBN : 0857298089
This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics; presents an unique system for automated proof verification in large-scale software systems; integrates important proof-engineering issues, reflecting the goals of large-scale verifiers; includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn’s lemma.