0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming > Programming languages

Buy Now

Algol-like Languages (Paperback, Softcover reprint of the original 1st ed. 1997) Loot Price: R2,946
Discovery Miles 29 460
Algol-like Languages (Paperback, Softcover reprint of the original 1st ed. 1997): Peter O'Hearn, Robert Tennent

Algol-like Languages (Paperback, Softcover reprint of the original 1st ed. 1997)

Peter O'Hearn, Robert Tennent

Series: Progress in Theoretical Computer Science

 (sign in to rate)
Loot Price R2,946 Discovery Miles 29 460 | Repayment Terms: R276 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

To construct a compiler for a modern higher-level programming languagel one needs to structure the translation to a machine-like intermediate language in a way that reflects the semantics of the language. little is said about such struc turing in compiler texts that are intended to cover a wide variety of program ming languages. More is said in the Iiterature on semantics-directed compiler construction [1] but here too the viewpoint is very general (though limited to 1 languages with a finite number of syntactic types). On the other handl there is a considerable body of work using the continuation-passing transformation to structure compilers for the specific case of call-by-value languages such as SCHEME and ML [21 3]. ln this paperl we will describe a method of structuring the translation of ALGOL-like languages that is based on the functor-category semantics devel oped by Reynolds [4] and Oles [51 6]. An alternative approach using category theory to structure compilers is the early work of F. L. Morris [7]1 which anticipates our treatment of boolean expressionsl but does not deal with procedures. 2 Types and Syntax An ALGOL-like language is a typed lambda calculus with an unusual repertoire of primitive types. Throughout most of this paper we assume that the primi tive types are comm(and) int(eger)exp(ression) int(eger)acc(eptor) int(eger)var(iable) I and that the set 8 of types is the least set containing these primitive types and closed under the binary operation -.

General

Imprint: Birkhauser Boston
Country of origin: United States
Series: Progress in Theoretical Computer Science
Release date: March 2013
First published: 1997
Authors: Peter O'Hearn • Robert Tennent
Dimensions: 235 x 155 x 19mm (L x W x T)
Format: Paperback
Pages: 349
Edition: Softcover reprint of the original 1st ed. 1997
ISBN-13: 978-1-4757-3853-7
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers
Books > Computing & IT > Computer programming > Programming languages > General
Promotions
LSN: 1-4757-3853-6
Barcode: 9781475738537

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners