Name: programming with higher-order logic (en Inglés)
Price: 256317.00 COP
Availability: InStock
Author: Miller, Dale ; Nadathur, Gopalan
ISBN: 9780521879408

portada programming with higher-order logic (en Inglés)

programming with higher-order logic (en Inglés)

Formato

Libro Físico

Autor

Dale Miller

Gopalan Nadathur

Editorial

Cambridge University Press

Idioma

Inglés

Encuadernación

Tapa Dura

Dimensiones

23.1 x 15.5 x 2.3 cm

Peso

0.54 kg.

ISBN

052187940x

ISBN13

9780521879408

Categorías

Programación orientada a objetos (poo)
Lenguajes de programación y extensión/scripting: general

programming with higher-order logic (en Inglés)

Dale Miller (Autor) · Gopalan Nadathur (Autor) · Cambridge University Press · Tapa Dura

Libro Nuevo Importado

Envío: 14 a 20 días háb.

$ 512.635$ 256.317

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 10 unidades

$ 256.317

¡Envío Gratis! Llega entre el 13 Jul y el 23 Jul a Bogota, Cundinamarca. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "programming with higher-order logic (en Inglés)"

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.