Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Barendregt (1985)
The Lambda Calculus: Its Syntax and Semantics
P. Achten (1996)
Interactive functional programs: models, methods, and implementation
E. Barendsen, S. Smetsers (1993)
Extending Graph Rewriting with Copying
J. McCarthy (1959)
Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 3
J. Armstrong, Robert Virding, Mike Williams (1993)
Concurrent programming in ERLANG
Mark Jones (1993)
A system of constructor classes: overloading and implicit higher-order polymorphismJournal of Functional Programming, 5
Marco Kesseler (1996)
The implementation of functional languages on parallel machines with distributed memory
P. Achten, M. Plasmeijer (1995)
The ins and outs of Clean I/OJournal of Functional Programming, 5
P. Wadler (1997)
How to declare an imperativeACM Comput. Surv., 29
J. Armstrong, Mike Williams, Robert Virding, Claes Wilkström (1993)
ERLANG for Concurrent Programming
Erik Barendsen, S. Smetsers (1996)
Uniqueness typing for functional languages with graph rewriting semanticsMathematical Structures in Computer Science, 6
P. Lincoln (1992)
Linear logicSIGACT News, 23
Tomek Brus, M. Eekelen, M. Leer, M. Plasmeijer (1987)
CLEAN: A language for functional graph writing
Daniel Turner (1985)
Miranda: A Non-Strict Functional language with Polymorphic Types
M. PaulHudakEt (1992)
Report on the programming language haskell: a non-strict
W. Hoon, Luc Rutten, M. Eekelen (1995)
Implementing a functional spreadsheet in cleanJournal of Functional Programming, 5
P. Hudak, S. Jones, P. Wadler, Brian Boutel, J. Fairbairn, J. Fasel, María Guzmán, K. Hammond, John Hughes, Thomas Johnsson, R. Kieburtz, R. Nikhil, Will Partain, J. Peterson (1992)
Report on the programming language Haskell: a non-strict, purely functional language version 1.2ACM SIGPLAN Notices, 27
ocker Smetsers, M. Eekelen, R. Plasmeijer, Glauert Kennaway (1991)
Concurrent Clean
X. Leroy (1995)
Le système Caml Special Light: modules et compilation efficace en Caml
(1994)
Simply Scheme
Marco Pil (1996)
First Class File I/O
M. Plasmeijer, M. Eekelen (1993)
Functional Programming and Parallel Graph Rewriting
R. Milner, R. Harper, David MacQueen (1986)
Standard ML: Report ECS-LFCS-86-2
P. Achten, M. Plasmeijer (1997)
Interactive Functional Objects in Clean
(1997)
CLEAN 1.2 Language Report
John Groningen (1996)
The Implementation and Efficiency of Arrays in Clean 1.1
J. Klop (1995)
Term Graph Rewriting
Functional Pro ming Editor: Philip Wadler, Bell Laboratories, Lucent Technologies; wadler@ research.bell-labs.cora Keep it CLEAN: A unique approach to functional programming. Rinus Plasmeijer and Marko van Eekelen Computing Science Institute, University of Nijmegen, Toernooiveld 1, 6525 ED, Nijmegen, The Netherlands rinus@cs.kun.nl, marko@cs.kun.nl CLEAN~is a functional language specially designed to make the development of real world applications possible. In this paper we give a short overview of the most important features of the language. The CLEAN compiler offers high compilation speed yet the quality of the produced native code is state-of-the-art. Of particular importance for practical use is CLEAN's uniqueness typing enabling destructive updates of arbitrary objects and the creation of direct interfaces with the outside world, all within a purely functional framework. CLEAN's "unique" features have been used to predefine (in CLEAN) a sophisticated I/O library enabling a CLEAN programmer to specify interactive window-based I/O applications on a very high level of abstraction. One can write programs creating and combining interactive objects with arbitrary local state. Furthermore, it is also possible to create lightweight processes which can communicate via files, shared state or (a)synchronous message passing primitives (including remote procedure call). Interactive CLEAN programs can be ported to
ACM SIGPLAN Notices – Association for Computing Machinery
Published: Jun 1, 1999
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.