Programming with higher-order logic - Info and Reading Options
By Dale Miller
"Programming with higher-order logic" was published by Cambridge University Press in 2012 - Cambridge, it has 306 pages and the language of the book is English.
“Programming with higher-order logic” Metadata:
- Title: ➤ Programming with higher-order logic
- Author: Dale Miller
- Language: English
- Number of Pages: 306
- Publisher: Cambridge University Press
- Publish Date: 2012
- Publish Location: Cambridge
“Programming with higher-order logic” Subjects and Themes:
- Subjects: ➤ Logic programming - Prolog (Computer program language) - COMPUTERS / Programming Languages / General
Edition Specifications:
- Pagination: pages cm
Edition Identifiers:
- The Open Library ID: OL25355366M - OL16681310W
- Online Computer Library Center (OCLC) ID: 774491609
- Library of Congress Control Number (LCCN): 2012016719
- ISBN-13: 9780521879408
- All ISBNs: 9780521879408
AI-generated Review of “Programming with higher-order logic”:
"Programming with higher-order logic" Table Of Contents:
- 1- Machine generated contents note: 1. First-order terms and representations of data; 2. First-order horn clauses; 3. First-order hereditary Harrop formulas; 4. Typed lambda terms and formulas; 5. Using quantification at higher-order types; 6. Mechanisms for structuring large programs; 7. Computations over [lambda]-terms; 8. Unification of [lambda]-terms; 9. Implementing proof systems; 10. Computations over functional programs; 11. Encoding a process calculus language; Appendix A. The Teyjus system.
"Programming with higher-order logic" Description:
The Open Library:
"Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However, these systems often embody variable binding, a notion that must be treated carefully at a computational level. This book aims to show that a programming language based on a simply typed version of higher-order logic provides an elegant, declarative means for providing such a treatment. Three broad topics are covered in pursuit of this goal. First, a proof-theoretic framework that supports a general view of logic programming is identified. Second, an actual language called [Lambda]Prolog is developed by applying this view to higher-order logic. Finally, a methodology for programming with specifications is exposed by showing how several computations over formal objects such as logical formulas, functional programs, and [lambda]-terms and [pi]-calculus expressions can be encoded in [Lambda]Prolog"--
Read “Programming with higher-order logic”:
Read “Programming with higher-order logic” by choosing from the options below.
Search for “Programming with higher-order logic” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Programming with higher-order logic” in Libraries Near You:
Read or borrow “Programming with higher-order logic” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Programming with higher-order logic” at a library near you.
Buy “Programming with higher-order logic” online:
Shop for “Programming with higher-order logic” on popular online marketplaces.
- Ebay: New and used books.