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
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Scope structures and defined functions in Lucid

Tools
- Tools
+ Tools

Ashcroft, E. A. and Wadge, W. W. (1977) Scope structures and defined functions in Lucid. Coventry, UK: Department of Computer Science..

Full text not available from this repository.
Official URL: http://eprints.dcs.warwick.ac.uk/1144/1/cs-rr-021....

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 > 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: October 1977
Identification Number: CS-RR-021
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/46314

Request changes to a record

Actions (login required)

View Item View Item
twitter

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