BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Solving Higher-Order Equations : From Logic to Programming (Progress in Theoretical Computer Science)

Solving Higher-Order Equations : From Logic to Programming (Progress in Theoretical Computer Science)

Solving Higher-Order Equations : From Logic to Programming (Progress in
Stock photo: cover may vary

Solving Higher-Order Equations : From Logic to Programming (Progress in Theoretical Computer Science) Hardback - 1997

by Prehofer, Christian

Add to wish list
  • Used
  • Hardback
Used: Good

Description

Birkhäuser, 1997-12-18. 1998. hardcover. Used: Good. 6.35x0.76x9.56. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$213.02
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Solving Higher-Order Equations : From Logic to Programming (Progress in Theoretical Computer Science)

From the publisher

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.

First line

This monograph develops techniques for equational reasoning in higher-order logic.
tracking-