Show simple item record

dc.contributor.authorConstable, Robert L.en_US
dc.contributor.authorDonahue, James E.en_US
dc.date.accessioned2007-04-23T17:48:05Z
dc.date.available2007-04-23T17:48:05Z
dc.date.issued1976-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-271en_US
dc.identifier.urihttps://hdl.handle.net/1813/6973
dc.description.abstractThe PL/CS language is an instructional variant of PL/C designed to provide a simple, easy-to-understand tool to teach a disciplined style of programming (see [Conway 1976]). This report gives a complete formal semantic specification of the language, following the style of [Scott and Strachey 1972]. In keeping with the goal of simplicity in the design of PL/CS, the formal definition is presented in an hierarchical fashion and uses only elementary mathematical concepts, such as set, relation, and recursive definition. Key Words: programming language semantics, denotational semantics, recursive functions, Pl/I, PL/C, PL/CS.en_US
dc.format.extent1758085 bytes
dc.format.extent852698 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Elementary Formal Semantics for the Programming Language PL/CSen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics