Thumbnail
Access Restriction
Subscribed

Author McGowan, Clement
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract Much work has been done towards characterizing the semantics of block structured programming languages using the lambda calculus [2]. Johnston [3] recently introduced a cell-based approach, called the contour model, for specifying the execution semantics of such languages. This paper relates the two approaches by giving a contour model evaluator for compiled lambda expressions. Section 2 gives the basic definitions needed from the lambda calculus to make the paper self-contained. Section 3 defines the Contour Model Lambda Calculus Machine (CMLCM). Unfortunately publication limitations preclude some worked examples which would greatly aid the reader's understanding. They will be provided in the talk itself and in an expanded version of this paper for the Tutorial Conference on Semantic Models of Computation. Section 4 outlines the structure of the proof of the CMLCM's correctness. And Section 5 is a set of concluding remarks on the significance of the CMLCM.
Description Affiliation: Center for Computer and Information Sciences, Division of Applied Mathematics, Brown University, Providence, Rhode Island (McGowan, Clement)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 7
Issue Number 1
Page Count 6
Starting Page 110
Ending Page 115


Source: ACM Digital Library