000 -LEADER |
fixed length control field |
02178nam a22003017a 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
IN-MiVU |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20230802125410.0 |
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS |
fixed length control field |
m|||||o||d| 00| 0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
fixed length control field |
cr uuu---uuuuu |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
180504s2009 xxu||||go|||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9780511569876 ( e-book ) |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
MAIN |
Language of cataloging |
eng |
Transcribing agency |
IN-MiVU |
041 0# - LANGUAGE CODE |
Language code of text/sound track or separate title |
eng |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Padawitz, Peter |
245 00 - TITLE STATEMENT |
Title |
Deductive and Declarative Programming [ electronic resource ] / |
Statement of responsibility, etc. |
by Peter Padawitz. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Name of publisher, distributor, etc. |
Cambridge University Press, |
Date of publication, distribution, etc. |
2009 |
440 #0 - SERIES STATEMENT/ADDED ENTRY--TITLE |
Title |
Cambridge Tracts in Theoretical Computer Science (28) |
520 ## - SUMMARY, ETC. |
Summary, etc. |
Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages. |
650 10 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Computer Science |
650 10 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Programming Languages and Applied Logic |
650 10 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Algorithmics |
650 10 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Complexity |
650 10 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Computer Algebra |
650 10 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Computational Geometry |
655 #4 - INDEX TERM--GENRE/FORM |
Genre/form data or focus term |
Electronic books |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
<a href="https://www.cambridge.org/core/books/deductive-and-declarative-programming/4FD16BB3789C5EE43D36B577BC87D29F">https://www.cambridge.org/core/books/deductive-and-declarative-programming/4FD16BB3789C5EE43D36B577BC87D29F</a> |
Link text |
https://www.cambridge.org/core/books/deductive-and-declarative-programming/4FD16BB3789C5EE43D36B577BC87D29F |
Public note |
View to click |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Koha item type |
E-Book |