| Lucid, a nonprocedural language with iteration |
| Full text |
 Pdf
(785 KB)
|
Source
|
Communications of the ACM
archive
Volume 20 , Issue 7 (July 1977)
table of contents
Pages: 519 - 526
Year of Publication: 1977
ISSN:0001-0782
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 17, Downloads (12 Months): 64, Citation Count: 38
|
|
|
 ABSTRACT
Lucid is a formal system in 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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Ashcroft, E.A., and Wadge, W.W. Lucid: A formal system for writing and proving programs. SIAMJ. Comptg. 5, 3 (Sept. 1976), 336-354.
|
| |
2
|
Ashcroft, E.A., and Wadge, W.W. Lucid: Scope structures and defined functions. Rep. CS-76-22, Computer Science Dept., U. of Waterloo.
|
| |
3
|
Burstall, R. Program proving as hand simulation with a little induction. Information Processing 74, North-Holland, Amsterdam, pp. 308-312.
|
 |
4
|
|
| |
5
|
Kahn, G. A preliminary theory for parallel programs. Res. Rep. No. 6, IRIA, France, Jan. 1973.
|
CITED BY 38
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
D. DeForest , A. Faustini , R. Lee, Hyperflow, Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, p.482-488, January 19-20, 1988, Pasadena, California, United States
|
|
|
|
|
|
Pierrick Gachet , Christophe Mauras , Patrice Quinton , Yannick Saouter, Alpha du centaur: a prototype environment for the design of parallel regular alorithms, Proceedings of the 3rd international conference on Supercomputing, p.235-243, June 05-09, 1989, Crete, Greece
|
|
|
|
|
|
|
|
|
|
|
|
Isabel Gouveia Lima , Richard Hopkins , Lindsay Marshall , David Mundy , Philip Treleaven, Decentralised control flow - based on UNIX, Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems, p.192-201, June 27-29, 1983, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sitij Agrawal , William Thies , Saman Amarasinghe, Optimizing stream programs using linear state space analysis, Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems, September 24-27, 2005, San Francisco, California, USA
|
|
|
|
|
|
|
|
|
J. Herath , Y. Yamaguchi , N. Saito , T. Yuba, Dataflow Computing Models, Languages, and Machines for Intelligence Computations, IEEE Transactions on Software Engineering, v.14 n.12, p.1805-1828, December 1988
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ross Tate , Michael Stepp , Zachary Tatlock , Sorin Lerner, Equality saturation: a new approach to optimization, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
