ISBN: 9780387941066
There are several theories of programming. The first usable theory, often called Hoare's Logic, is still probably the most widely known. In it, a specification is a pair of predicates:… Más…
BarnesandNoble.com new in stock. Gastos de envío:zzgl. Versandkosten., más gastos de envío Details... |
ISBN: 9780387941066
There are several theories of programming. The first usable theory, often called "Hoare's Logic", is still probably the most widely known. In it, a specification is a pair of predicates: … Más…
Springer.com Nr. 978-0-387-94106-6. Gastos de envío:Worldwide free shipping, , DE. (EUR 0.00) Details... |
A Practical Theory of Programming (Texts and Monographs in Computer Science). - encuadernado, tapa blanda
1993, ISBN: 0387941061
17,8 x 1,6 x 25,4 cm, hardcover. 257 p. Gebundene Ausgabe In very good condition. ISBN: 9780387941066 2, [PU:Springer,]
Achtung-Buecher.de Wissenschaftliches Antiquariat Thomas Haker e.K. Amtsgericht Freiburg, Registernummer: HRA 703494 A, 79771 Klettgau-Erzingen Gastos de envío:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
1993, ISBN: 0387941061
[EAN: 9780387941066], Neubuch, [PU: Springer], Clean and crisp and new!, Books
AbeBooks.de Welcome Back Books, Toledo, OH, U.S.A. [64434632] [Rating: 5 (von 5)] NEW BOOK. Gastos de envío: EUR 36.35 Details... |
1993, ISBN: 0387941061
[EAN: 9780387941066], Neubuch, [PU: Springer], Books
AbeBooks.de Lucky's Textbooks, Dallas, TX, U.S.A. [60577173] [Rating: 5 (von 5)] NEW BOOK. Gastos de envío: EUR 68.16 Details... |
ISBN: 9780387941066
There are several theories of programming. The first usable theory, often called Hoare's Logic, is still probably the most widely known. In it, a specification is a pair of predicates:… Más…
ISBN: 9780387941066
There are several theories of programming. The first usable theory, often called "Hoare's Logic", is still probably the most widely known. In it, a specification is a pair of predicates: … Más…
A Practical Theory of Programming (Texts and Monographs in Computer Science). - encuadernado, tapa blanda
1993
ISBN: 0387941061
17,8 x 1,6 x 25,4 cm, hardcover. 257 p. Gebundene Ausgabe In very good condition. ISBN: 9780387941066 2, [PU:Springer,]
1993, ISBN: 0387941061
[EAN: 9780387941066], Neubuch, [PU: Springer], Clean and crisp and new!, Books
1993, ISBN: 0387941061
[EAN: 9780387941066], Neubuch, [PU: Springer], Books
Datos bibliográficos del mejor libro coincidente
Autor: | |
Título: | |
ISBN: |
Detalles del libro - A Practical Theory of Programming Eric C.R. Hehner Author
EAN (ISBN-13): 9780387941066
ISBN (ISBN-10): 0387941061
Tapa dura
Tapa blanda
Año de publicación: 1993
Editorial: Springer New York Core >2 >T
260 Páginas
Peso: 0,688 kg
Idioma: eng/Englisch
Libro en la base de datos desde 2008-04-21T16:13:23-05:00 (Mexico City)
Página de detalles modificada por última vez el 2024-02-05T16:00:02-06:00 (Mexico City)
ISBN/EAN: 9780387941066
ISBN - escritura alterna:
0-387-94106-1, 978-0-387-94106-6
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: eric, hehne, hehn, hehner, dijkstra
Título del libro: practical programming, practical theory, practical vim, monographs
Datos del la editorial
Autor: Eric C.R. Hehner
Título: Monographs in Computer Science; A Practical Theory of Programming
Editorial: Springer; Springer US
247 Páginas
Año de publicación: 1993-08-06
New York; NY; US
Peso: 1,570 kg
Idioma: Inglés
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
X, 247 p.
BB; Software Engineering/Programming and Operating Systems; Hardcover, Softcover / Informatik, EDV/Informatik; Software Engineering; Verstehen; control; data structures; design; development; functional programming; language; programming; programming language; software; time; verification; Software Engineering; BC; EA
1 Basic Theories.- Boolean Theory.- Axioms and Proof Rules.- Expression and Proof Format.- Formalization.- Number Theory.- Character Theory.- 2 Basic Data Structures.- Bunch Theory.- Set Theory.- String Theory.- List Theory.- Multidimensional Structures.- 3 Function Theory.- Functions.- Abbreviated Function Notations.- Scope and Substitution.- Quantifiers.- Function Fine Points.- Substitution versus Distribution.- Function Inclusion and Equality.- Function Composition.- List as function.- 4 Program Theory.- Specifications.- Specification Notations.- Specification Laws.- Refinement.- Conditions.- Programs.- Program Development.- Refinement Laws.- List Summation.- Binary Exponentiation.- Time.- Real Time.- Recursive Time.- Termination.- Linear Search.- Binary Search.- Fast Exponentiation.- Fibonacci Numbers.- Robustness.- Refinement in Place.- 5 Programming Language.- Scope.- Variable Declaration.- Variable Suspension.- Data Structures.- Arrays.- Records.- Control Structures.- While Loop.- Repeat Loop.- Exit Loop.- Two-Dimensional Search.- For Loop.- Minimum Sum Segment.- Go To.- Time Dependence.- Assertions.- Checking.- Backtracking.- Subprogram.- Result Expression.- Function.- Procedure.- Alias.- Functional Programming.- Function Refinement.- 6 Recursive Definition.- Recursive Data Definition.- Construction and Induction.- Least Fixed-Points.- Recursive Data Construction.- Recursive Program Definition.- Recursive Program Construction.- Loop Definition.- Limits.- 7 Theory Design and Implementation.- Data Theories.- Data-Stack Theory.- Data-Stack Implementation.- Simple Data-Stack Theory.- Data-Queue Theory.- Data-Tree Theory.- Data-Tree Implementation.- Program Theories.- Program-Stack Theory.- Program-Stack Implementation.- Fancy Program-Stack Theory.- Weak Program-Stack Theory.- Program-Queue Theory.- Program-Tree Theory.- Specification by Implementation.- Data Transformation.- 8 Concurrency.- Independent Composition.- Laws of Independent Composition.- List Concurrency.- Circuit Design.- Security Switch.- Found Concurrency.- Buffer.- Insertion Sort.- 9 Communication.- Implementability.- Input and Output.- Communication Timing.- Recursively Defined Communication.- Input Composition.- Merge.- Monitor.- Reaction Controller.- Communicating Processes.- Channel Declaration.- Deadlock.- Power Series Multiplication.- 10 Exercises.- Basic Theories.- Basic Data Structures.- Function Theory.- Program Theory.- Programming Language.- Recursive Definition.- Theory Design and Implementation.- Concurrency.- Communication.- 11 Reference.- Justifications.- Sources.- Axioms and Laws.- Symbols and Names.- Precedence.Más, otros libros, que pueden ser muy parecidos a este:
Último libro similar:
9781441985965 A Practical Theory of Programming (Eric C. R. Hehner)
< para archivar...