Picture 1 of 1

Gallery
Picture 1 of 1

Algol-like Languages (Progress in Theoretical Computer Science Volume 2)
US $14.42
ApproximatelyPHP 804.48
Condition:
Good
A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free Standard Shipping.
Located in: Powder Springs, Georgia, United States
Delivery:
Estimated between Tue, 10 Jun and Sat, 14 Jun to 94104
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:296977505969
Item specifics
- Condition
- Release Year
- 1996
- Book Title
- Algol-like Languages (Progress in Theoretical Computer Science...
- ISBN
- 9780817639372
About this product
Product Identifiers
Publisher
Birkhäuser Boston
ISBN-10
0817639373
ISBN-13
9780817639372
eBay Product ID (ePID)
318922
Product Key Features
Number of Pages
VII, 349 Pages
Publication Name
Algol-Like Languages
Language
English
Publication Year
1996
Subject
Programming Languages / General, Computer Science, Applied, Compilers
Type
Textbook
Subject Area
Mathematics, Computers
Series
Progress in Theoretical Computer Science Ser.
Format
Hardcover
Dimensions
Item Height
0.3 in
Item Weight
53.6 Oz
Item Length
9.2 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
96-046972
Series Volume Number
Vol. 2
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
005.13/1
Table Of Content
11 Functor Categories and Store Shapes.- 12 Using Functor Categories to Generate Intermediate Code.- 13 Semantical Analysis of Specification Logic.- 14 Semantical Analysis of Specification Logic, 2.- 15 Full Abstraction for the Second-Order Subset.- 16 Parametricity and Local Variables.- 17 Operationally-Based Reasoning About Local Variables.- 18 Syntactic Control of Interference Revisited.- 19 Global State Considered Unnecessary.- 20 Linearity, Sharing and State.- 21 The Essence of Parallel Algol.- of Volume 1.
Synopsis
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 -., 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 -.
LC Classification Number
QA76.9.M35
Item description from the seller
Popular categories from this store
Seller feedback (415,867)
- 1***r (841)- Feedback left by buyer.Past monthVerified purchaseBook just arrived in excellent condition. A great value. It arrived promptly and well packaged. It is in new condition. Excellent seller. Thank you!
- o***c (3436)- Feedback left by buyer.Past monthVerified purchaseLove purchase. Great seller.
- e***a (86)- Feedback left by buyer.Past monthVerified purchaseExcelente 👌