Summer Reading Sale
 
 

Recently Viewed clear list


Original Essays | July 24, 2014

Jessica Valenti: IMG Full Frontal Feminism Revisited



It is arguably the worst and best time to be a feminist. In the years since I first wrote Full Frontal Feminism, we've seen a huge cultural shift in... Continue »
  1. $11.90 Sale Trade Paper add to wish list

spacer
Qualifying orders ship free.
$76.50
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote 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.

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:
9780521018470
Editor:
Van Rijsbergen, C. J.
Publisher:
Cambridge University Press
Editor:
Van Rijsbergen, C. J.
Author:
Nielson, Flemming
Author:
Nielson, Hanne Riis
Location:
Cambridge
Subject:
Programming Languages - General
Subject:
Programming - Software Development
Subject:
Functional programming languages
Subject:
Functional programming languages Functional p
Subject:
Software Development & Engineering - General
Subject:
Software Engineering - Programming and Languages
Edition Description:
Pbk Version
Series:
Cambridge Tracts in Theoretical Computer Science
Series Volume:
34
Publication Date:
20050631
Binding:
TRADE PAPER
Grade Level:
Professional and scholarly
Language:
English
Illustrations:
Y
Pages:
312
Dimensions:
6.69x9.60x.65 in. 1.10 lbs.

Related Subjects

Computers and Internet » Software Engineering » General
Computers and Internet » Software Engineering » Programming and Languages
Science and Mathematics » History of Science » General

Two-Level Functional Languages New Trade Paper
0 stars - 0 reviews
$76.50 In Stock
Product details 312 pages Cambridge University Press - English 9780521018470 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.