Name: Two-Level Functional Languages Hardback (Cambridge Tracts in Theoretical Computer Science) (en Inglés)
SKU: 19188580
Price: 3372.54 MXN
Availability: InStock
Author: Nielson
ISBN: 9780521403849

portada Two-Level Functional Languages Hardback (Cambridge Tracts in Theoretical Computer Science) (en Inglés)

Two-Level Functional Languages Hardback (Cambridge Tracts in Theoretical Computer Science) (en Inglés)

Formato

Libro Físico

Editorial

Cambridge University Press

Autor

Nielson

Año

1992

Idioma

Inglés

N° páginas

311

Encuadernación

Tapa Dura

ISBN

0521403847

ISBN13

9780521403849

N° edición

Categorías

Lenguajes de programación y extensión/scripting: general

Two-Level Functional Languages Hardback (Cambridge Tracts in Theoretical Computer Science) (en Inglés)

Nielson (Autor) · Cambridge University Press · Tapa Dura

Libro Nuevo Importado

Envío: 17 a 22 días háb.

$ 6,745.08$ 3,372.54

-50%

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

Libro Nuevo

Quedan 100 unidades

$ 3,372.54

¡Envío Gratis! Llega entre el 13 Oct y el 21 Oct a CUAUHTÉMOC, Ciudad de México. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Two-Level Functional Languages Hardback (Cambridge Tracts in Theoretical Computer Science) (en Inglés)"

The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently, the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of "parametrized semantics" is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose, it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalizes Wadler's analysis for lists. It is also shown how the results of abstract interpretation may be used to improve the code generation.