Which model of programming for LISP

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Which model of programming for LISP: sequential, functional or mixed?

Full text

Pdf (911 KB)

Source

ACM SIGPLAN Notices archive
Volume 26 , Issue 10 (October 1991) table of contents

Pages: 83 - 92

Year of Publication: 1991

ISSN:0362-1340

Author

C. K. Yuen

DISCS, NUS, Kent Ridge, Singapore 0511

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 13, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/122616.122626 What is a DOI?

ABSTRACT

This article reviews models of programming applicable to Lisp, and argues that both the sequential model and the functional model have developed in directions of excessive complexity. For future developments, a mixed model based on old-style Lisp, but augmented with new parallel constructs, can provide a simpler tool for handling practical programming tasks.

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	John McCarthy, History of LISP, History of programming languages I, ACM, New York, NY, 1978 [doi>10.1145/800025.1198360]
	2	Paul Hudak, Conception, evolution, and application of functional programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.359-411, Sep. 1989 [doi>10.1145/72551.72554]
	3	Richard P. Gabriel , John McCarthy, Qlisp, Parallel computation and computers for artificial intelligence, Kluwer Academic Publishers, Norwell, MA, 1988
	4	Arvind , Rishiyur S. Nikhil , Keshav K. Pingali, I-structures: data structures for parallel computing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.598-632, Oct. 1989 [doi>10.1145/69558.69562]
	5	[5] C K Yuen and W F Wong, "BaLinda Lisp: a parallel list-processing language", Proc IEEE Conf on Tools for AI, Nov. 1990, pp. 618-624.
	6	Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989 [doi>10.1145/63334.63337]
	7	[7] P Wadler, "Efficient compilation of pattern matching", in S L Peyton Jones, The Implementation of Functional Programming Languages, Prentice-Hall, 1987, pp. 78-103.
	8	C. K. Yuen , W. F. Wong, A self interpreter for BaLinda Lisp, ACM SIGPLAN Notices, v.25 n.7, p.39-58, July 1990 [doi>10.1145/382076.382644]
	9	[9] M D Feng, "Parallel Processing in BaLinda Lisp", Tech Rep No. TR41/90, DISCS, NUS, November 1990.

CITED BY 2

	M. D. Feng , C. K. Yuen, A transputer-based parallel Lisp implementation, Proceedings of the 1992 ACM annual conference on Communications, p.83-90, March 03-05, 1992, Kansas City, Missouri, United States
	C. K. Yuen, Hamming numbers, lazy evaluation, and eager disposal, ACM SIGPLAN Notices, v.27 n.8, p.71-75, Aug. 1992