Summer Reading Sale
 
 

Recently Viewed clear list


Original Essays | June 20, 2014

Lauren Owen: IMG The Other Vampire



It's a wild and thundery night. Inside a ramshackle old manor house, a beautiful young girl lies asleep in bed. At the window, a figure watches... Continue »

spacer

On Order

$183.25
New Hardcover
Currently out of stock.
Add to Wishlist
available for shipping or prepaid pickup only
Qty Store Section
- Local Warehouse Software Engineering- Programming and Languages

This title in other editions

Two-Level Functional Languages

by

Two-Level Functional Languages Cover

 

Synopses & Reviews

Publisher Comments:

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.

Synopsis:

This book provides a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times.

Description:

Includes bibliographical references (p. 285-292) and index.

Table of Contents

1. Introduction; 2. Types made explicit; 3. Binding-time made explicit; 4. Combinators made explicit; 5. Parametrized semantics; 6. Code generation; 7. Abstract interpretation; 8. Conclusions; Bibliography; Summary of transformation functions; Index.

Product Details

ISBN:
9780521403849
Author:
Nielson, Flemming
Publisher:
Cambridge University Press
Author:
Nielson, Hanne Riis
Author:
Van Rijsbergen, C. J.
Author:
C. J. van Rijsbergen
Location:
Cambridge ;
Subject:
Programming - Software Development
Subject:
Functional programming languages
Subject:
General Computers
Subject:
Programming Languages - General
Subject:
Software Engineering - Programming and Languages
Series:
Studies in Australian History
Series Volume:
34
Publication Date:
19920731
Binding:
Paperback
Grade Level:
Professional and scholarly
Language:
English
Illustrations:
4 line diagrams 35 tables
Pages:
311

Other books you might like

  1. Programming in Modula 2 2ND Edition Used Hardcover $1.00
  2. Functional Programming and... New Hardcover $134.25
  3. Mathematics Form and Function New Trade Paper $108.50
  4. Common LISP Modules: Artificial... New Trade Paper $108.50

Related Subjects

Computers and Internet » Software Engineering » Programming and Languages

Two-Level Functional Languages New Hardcover
0 stars - 0 reviews
$183.25 Backorder
Product details 311 pages Cambridge University Press - English 9780521403849 Reviews:
"Synopsis" by , This book provides a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.