Wadge, William W. (1978) Programming constructs for nonprocedural languages. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

Text WRAP_Wadge_cs-rr-023.pdf - Published Version Download (898Kb) | Preview

Request Changes to record.

Abstract

In this paper how a pure denotative (nonprocedural) language based on the lambda calculus can be provided with purely denotative analogs of the various constructs - such as while loops, blocks, case statements and the like - of conventional imperative structured programming languages. They can be simulated quite adequately using only two simple tools: phrases, which are compound expressions not unlike blocks, and pronouns, special variables not unlike keywords between which certain relationships are 'understood' to hold.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Nonprocedural languages (Programming languages), Lambda calculus
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	March 1978
Dates:	Date Event March 1978 ["eprint_fieldopt_dates_date_type_available" not defined]
Number:	Number 23
Number of Pages:	12
DOI:	CS-RR-023
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Access rights to Published version:	Open Access (Creative Commons)
Description:	Presented at the 3rd International Symposium on Programming, Paris, March 1978.
Date of first compliant deposit:	1 August 2016
Date of first compliant Open Access:	1 August 2016

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads