Formal systems in computer science frequently involve specifications of computations over syntactic structures. In this book, the authors develop a programming language based on a simply typed version of higher-order logic and show that it provides an elegant approach to performing computations over structures embodying binding.
"Sinopsis" puede pertenecer a otra edición de este libro.
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 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 15994847-n
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: new. Hardcover. 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 lProlog 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 l-terms and p-calculus expressions can be encoded in lProlog. Formal systems in computer science frequently involve specifications of computations over syntactic structures. In this book, the authors develop a programming language based on a simply typed version of higher-order logic and show that it provides an elegant approach to performing computations over structures embodying binding. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9780521879408
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9780521879408
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 15994847
Cantidad disponible: Más de 20 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Hardback. Condición: New. 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. Nº de ref. del artículo: LU-9780521879408
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9780521879408_new
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 1st edition. 320 pages. 9.10x6.00x0.90 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __052187940X
Cantidad disponible: 1 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 15994847-n
Cantidad disponible: Más de 20 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Nº de ref. del artículo: C9780521879408
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 15994847
Cantidad disponible: Más de 20 disponibles