Refal
Sign in to saveAlso known as Recursive functions algorithmic language
Refal ("Recursive functions algorithmic language"; ) "is a functional programming language oriented toward symbolic computations", including "string processing, language translation, [and] artificial intelligence". It is one of the oldest members of this family, first conceived of in 1966 as a theoretical tool, with the first implementation appearing in 1968. Refal was intended to combine mathematical simplicity with practicality for writing large and sophisticated programs.
Official website
Cодружество "РЕФАЛ/Суперкомпиляция"
refal.net →Link to the official site · 2,464 chars · not written by Vinony
Wikidata facts
- Official website
- www.refal.net
Show 1 more fact
- inception
- 1968-01-01
Sources (3)
via Wikidata · CC0
~6 min read
Article
10 sectionsContents
- Basics
- Other examples
- Factorial
- Factorial with loops
- Equality
- If
- Squeeze blanks
- Squeeze using explicit looping
- References
- External links
Refal ("Recursive functions algorithmic language"; ) "is a functional programming language oriented toward symbolic computations", including "string processing, language translation, [and] artificial intelligence". It is one of the oldest members of this family, first conceived of in 1966 as a theoretical tool, with the first implementation appearing in 1968. Refal was intended to combine mathematical simplicity with practicality for writing large and sophisticated programs.
One of the first functional programming languages to do so, and unlike Lisp of its time, Refal is based on pattern matching. Its pattern matching works in conjunction with term rewriting.