KRC
- languages
David Turner developed the Kent Recursive Calculator, KRC, as part of the lazy functional-language line that also includes SASL and Miranda. List comprehensions provided a concise notation for generating and filtering lists from declarative descriptions. The language explored how non-strict evaluation and high-level sequence processing could work together. Its significance is both a usable experimental system and an influence on subsequent language design. Later Haskell comprehensions belong to that broader history rather than being identical to every detail of KRC’s syntax and implementation. **Timeline anchor:** 1 January 1981 CE. Year of release. **References:** [Source 1](https://en.wikipedia.org/wiki/Kent_Recursive_Calculator).
Sources
Related
On other timelines
- KRC’s recursion-equation approach is described in print on Haskell · origins, language reports and the evolution of GHC by @athan