Progress in Theoretical Computer Science

Algol-like Languages

Authors: O'Hearn, Peter, Tennent, Robert

Buy this book

eBook $129.00
price for USA (gross)
  • ISBN 978-1-4757-3851-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $199.00
price for USA
  • ISBN 978-0-8176-3937-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $169.00
price for USA
  • ISBN 978-1-4757-3853-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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 -.

Table of contents (11 chapters)

  • Functor Categories and Store Shapes

    Oles, Frank J.

    Pages 3-12

  • Using Functor Categories to Generate Intermediate Code

    Reynolds, John C.

    Pages 13-38

  • Semantical Analysis of Specification Logic

    Tennent, Robert D.

    Pages 41-64

  • Semantical Analysis of Specification Logic, 2

    O’Hearn, Peter W. (et al.)

    Pages 65-93

  • Full Abstraction for the Second-Order Subset of an Algol-like Language

    Sieber, Kurt

    Pages 97-107

Buy this book

eBook $129.00
price for USA (gross)
  • ISBN 978-1-4757-3851-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $199.00
price for USA
  • ISBN 978-0-8176-3937-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $169.00
price for USA
  • ISBN 978-1-4757-3853-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Algol-like Languages
Authors
Series Title
Progress in Theoretical Computer Science
Copyright
1997
Publisher
Birkhäuser Basel
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4757-3851-3
DOI
10.1007/978-1-4757-3851-3
Hardcover ISBN
978-0-8176-3937-2
Softcover ISBN
978-1-4757-3853-7
Edition Number
1
Number of Pages
VII, 349
Topics