ACM Home Page
Please provide us with feedback. Feedback
Compiling the graphical functional language PROGRAPH
Full text PdfPdf (812 KB)
Source Symposium on Small Systems archive
Proceedings of the 1985 ACM SIGSMALL symposium on Small systems table of contents
Danvers, Massachusetts, United States
Pages: 34 - 41  
Year of Publication: 1985
ISBN:0-89791-154-7
Authors
P. T. Cox  Technical University of Nova Scotia, Canada
I. J. Mulligan  Bell Northern Research, Canada
Sponsor
SIGSMALL : ACM Special Interest Group on Small and Personal Computing Systems and Applications
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Citation Count: 2
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/317164.317169
What is a DOI?

ABSTRACT

The imperative style of standard programming languages is not appropriate for many modern computing tasks involving manipulation of symbols and complex structures. These applications require higher level declarative languages such as Lisp and Prolog. A brief description is given of the functional language PROGRAPH, which overcomes some of the shortcomings of Lisp by replacing the usual textual representation of programs by pictures called “prographs”. An abstract machine is defined having an architecture similar to most conventional computers, and suitable as a target machine for compiling prographs. An outline is given of an implementation in Prolog of a PROGRAPH compiler, based on this abstract machine.


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
2
 
3
Cox, P.T.; Pietr-zykowski, T., Implementing PROGRAPH in Prolog: the interpreter graphical interface, Proc. 5th National Conf. of CSCSI, (1984), 119- 123.
 
4
Cox, P.T.; Piet r-zykowski, T.; Matwin, S., Concurrent editing and executing in PROGRAPH on graphical microcomputers, Proc. Z4th Intl. Syrup. MIMI 84, (t984), 140-146.
 
5
GPL Programming Manual, Research Report, CS Dept., University of Utah (July 1981).
 
6
Haridi, S.; Ciepielewski, A., An OR- parallel Token Machine, Proc. Logic Programming Workshop 83, Portugal (1983), 537-552.
 
7
 
8
HcOabe, F.G.; Clark, K.L., micro- PROLOG 3.0 Programmer*s Reference Manual, Logic Programming Associates, London (1983).
 
9
Hulligan, I.J., A Compiler for PROGRAPH, Honours Thesis, School of Computer Science, Acadia University (1984).
 
10
Pietr-zykowski, T.; Hatwin S., PROGRAPH: A Preliminary Report, Programming Languages (to appear).
 
11
Piet r-zykowski, T.; Hatwin, S.; Muldne r, T., Programming Language PROQRAPH: yet another application of graphics, Proc. Graphics Interface 83, Edmonton (1983).
 
12
Tick, E.; Warren, D.H.D., Towards a Pipelined Prolog Processor, Proc. Int. $ymp. on Logic Programming, Atlantic City (1984), 29-41.
13

Collaborative Colleagues:
P. T. Cox: colleagues
I. J. Mulligan: colleagues