Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Scope structures and defined functions in Lucid

Tools
- Tools
+ Tools

Ashcroft, Edward A. and Wadge, William W. (1977) Scope structures and defined functions in Lucid. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

[img]
Preview
Text
WRAP_Ashcroft_cs-rr-021.pdf - Published Version

Download (1800Kb) | Preview

Request Changes to record.

Abstract

In the paper we describe how Lucid can be extended to allow user-defined functions and scope conventions, i.e. conventions or limiting the range or scope of the validity of definitions. The new 1constructs added (they are called clauses) are similar in form to the blocks and procedure declarations of A1go1-like languages, but are nevertheless strictly non-imperative, because a clause is actually a compound assertion, i.e. an assertion formed aS d program is, by combining a collection of assertions. Each type of clause (there are four) has a straightforward mathematical semantics together with its own characteristic "manipulation
rules" for general program massage. In addition, the informal operational view of (some) Lucid programs (described in a previous paper) can be extended to give an (incomplete) operational understanding of the effect of the clauses. In this framework a "compute" clause defines a block; a "mapping clause" defines a conventional (pointwise) function; a "produce" clause defines a block with persistent memory (an anonymous processor 'actor'); and a "function" clause defines a general kind of coroutine.

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): Lucid (Computer program language)
Series Name: Theory of Computation Report
Publisher: University of Warwick. Department of Computer Science
Official Date: October 1977
Dates:
DateEvent
October 1977["eprint_fieldopt_dates_date_type_available" not defined]
Number: Number 21
Number of Pages: 41
DOI: CS-RR-021
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)
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 View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us