menu
{ "item_title" : "Programming with Higher-Order Logic", "item_author" : [" Dale Miller", "Gopalan Nadathur "], "item_description" : "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.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/52/187/940/052187940X_b.jpg", "price_data" : { "retail_price" : "61.00", "online_price" : "61.00", "our_price" : "61.00", "club_price" : "61.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Programming with Higher-Order Logic|Dale Miller

Programming with Higher-Order Logic

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9780521879408
  • ISBN-10: 052187940X
  • Publisher: Cambridge University Press
  • Publish Date: June 2012
  • Dimensions: 9.1 x 6.1 x 0.9 inches
  • Shipping Weight: 1.2 pounds
  • Page Count: 320

Related Categories

You May Also Like...

    1

BAM Customer Reviews