Ashcroft, E. A. and Wadge, W. W. (1976) Lucid, a nonprocedural language with iteration. Coventry, UK: Department of Computer Science..

Full text not available from this repository.

Abstract

Lucid is a formal system which programs can be written and proofs of programs carried out. The proofs are particularly easy to follow and straightforward to produce because the statements in a Lucid program are simply axioms from which the proof proceeds by (almost) conventional logical reasoning, with the help of a few axioms and rules of inference for the special Lucid functions. As a programming language, Lucid is unconventional because, among other things, the order of statements is irrelevant and assignment statements are equations. Nevertheless Lucid programs need not look much different than iterative programs in a conventional structured programming language using assignment and conditional statements and loops.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science)
Divisions:	Faculty of Science > Computer Science
Publisher:	Department of Computer Science
Place of Publication:	Coventry, UK
Date:	April 1976
Identification Number:	CS-RR-011
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Open Access
Related URLs:	Other Repository
URI:	http://wrap.warwick.ac.uk/id/eprint/46307

Request changes to a record

Actions (login required)

View Item