Search the Library Catalogue
Solving Higher-order Equations (Record no. 574887)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01738nam a22001937a 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 250706b |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780817640323 |
| Paper back/Hardbound | hbk |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.13 |
| Item number | PRE |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Christian Prehofer |
| 245 ## - TITLE STATEMENT | |
| Title | Solving Higher-order Equations |
| Sub Title | : from logic to programming |
| Statement of responsibility, etc | Christian Prehofer |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Boston |
| Name of publisher | Birkhauser |
| Year of publication | 1998 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | vii; 186 p. |
| Dimensions | 24 cm., |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographies and index |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This monograph develops techniques for equational reasoning in higher-order logic. Due to its expressiveness, higher-order logic is used for specification and verification of hardware, software, and mathematics. In these applica tions, higher-order logic provides the necessary level of abstraction for con cise and natural formulations. The main assets of higher-order logic are quan tification over functions or predicates and its abstraction mechanism. These allow one to represent quantification in formulas and other variable-binding constructs. In this book, we focus on equational logic as a fundamental and natural concept in computer science and mathematics. We present calculi for equa tional reasoning modulo higher-order equations presented as rewrite rules. This is followed by a systematic development from general equational rea soning towards effective calculi for declarative programming in higher-order logic and A-calculus. This aims at integrating and generalizing declarative programming models such as functional and logic programming. In these two prominent declarative computation models we can view a program as a logical theory and a computation as a deduction<br/> |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Programmation Déclarative |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Reference |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession Number | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Anna Centenary Library | Anna Centenary Library | 3RD FLOOR, A WING | 06.09.2010 | 005.13 PRE | 208845 | 06.07.2025 | Reference |