Kent Recursive Calculator
| Paradigm | functional |
|---|---|
| Designed by | David Turner |
| First appeared | 1981 |
| Influenced by | |
| SASL | |
| Influenced | |
| Miranda | |
KRC (Kent Recursive Calculator) is a lazy functional language developed by David Turner from November 1979 to October 1981[1] based on SASL, with pattern matching, guards and ZF expressions[2] (now more usually called list comprehensions). Two implementations of KRC were written: David Turner's original one in BCPL running on EMAS, and Simon J. Croft's later one in C under Unix, and KRC was the main language used for teaching functional programming at the University of Kent at Canterbury (UK) from 1982 to 1985.
The direct successor to KRC is Miranda, which includes a polymorphic type discipline based on that of Milner's ML.
Further reading
- Functional Programming and its Applications, David A. Turner, Cambridge U Press 1982.
- Turner, D.A. (1981). "The semantic elegance of Applicative Languages". Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture. Association for Computing Machinery. pp. 85–92. ISBN 0-89791-060-5.
References
- ↑ Dates in the commentary to the BCPL KRC source code for EMAS.
- ↑ This article is based on material taken from the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the "relicensing" terms of the GFDL, version 1.3 or later.
This article is issued from Wikipedia - version of the 11/8/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.