Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Programming with Higher-Order Logic

$79.99

textbook
  • Date Published: June 2012
  • availability: In stock
  • format: Hardback
  • isbn: 9780521879408

$79.99
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
About the Authors
  • 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 λ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 λ-terms and π-calculus expressions can be encoded in λProlog.

    • All code fragments in the book are available via the author website associated with the book
    • Shows that a programming language based on a simply typed version of higher-order logic provides an elegant, declarative means for providing such a treatment
    Read more

    Reviews & endorsements

    "Overall, I am impressed with the depth of the discussion and the clearly well-produced book. The authors have argued successfully for the power and versatility of the fundamental ideas underlying λProlog."
    Sara Kalvala, Computing Reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: June 2012
    • format: Hardback
    • isbn: 9780521879408
    • length: 320 pages
    • dimensions: 235 x 158 x 19 mm
    • weight: 0.55kg
    • contains: 81 b/w illus.
    • availability: In stock
  • Table of Contents

    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 λ-terms
    8. Unification of λ-terms
    9. Implementing proof systems
    10. Computations over functional programs
    11. Encoding a process calculus language
    Appendix: the Teyjus system.

  • Authors

    Dale Miller, INRIA Saclay – Ile de France
    Dale Miller is currently Director of Research at INRIA-Saclay where he is the Scientific Leader of the Parsifal team. He has been a professor at the University of Pennsylvania, Pennsylvania State University and the École Polytechnique, France. Miller is the Editor-in-Chief of the ACM Transactions on Computational Logic and has editorial duties on several other journals. He was awarded an ERC Advanced Investigators Grant in 2011 and is the recipient of the 2011 Test-of-Time award of the IEEE Symposium on Logic in Computer Science. He works on many topics in the general area of computational logic, including automated reasoning, logic programming, proof theory, unification theory, operational semantics and, most recently, proof certificates.

    Gopalan Nadathur, University of Minnesota
    Gopalan Nadathur is Professor of Computer Science at the University of Minnesota. He has previously held faculty appointments at Duke University, the University of Chicago and Loyola University Chicago. Nadathur's research interests span the areas of computational logic, programming languages and logic programming. His work has been regularly funded by the National Science Foundation and has appeared in publications such as the Journal of the Association of Computing Machinery, Information and Computation, Logic and Computation, the Journal of Automated Reasoning and Theory and Practice of Logic Programming.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×