Abstract
Clean is a state-of-the-art lazy pure functional language which offers:
-
Higher order functions and currying
-
Lazy evaluation and (cyclic) sharing
-
Lambda expressions and local definitions (where and let)
-
Guards and case expressions, patterns, and list and array comprehensions
-
Strong typing with Milner/Mycroft type inference (with polymorphic types, abstract types, algebraic types, synonym types) extended with existentially quantified types, overloading via type classes and type constructor classes
-
Predefined types and type constructors (integers, reals, booleans, characters, files, lists, tuples, records, arrays)
-
strictness annotations in (function and data) type definitions
-
Separate compilation of modules (with implementation and definition modules with implicit or explicit imports).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London
About this chapter
Cite this chapter
Plasmeijer, R., van Eekelen, M., Pil, M., Serrarens, P. (1999). Parallel and Distributed Programming in Concurrent Clean. In: Hammond, K., Michaelson, G. (eds) Research Directions in Parallel Functional Programming. Springer, London. https://doi.org/10.1007/978-1-4471-0841-2_15
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0841-2_15
Publisher Name: Springer, London
Print ISBN: 978-1-85233-092-7
Online ISBN: 978-1-4471-0841-2
eBook Packages: Springer Book Archive