LANGREITER.COM plain, simple | |||||||
![]() ![]() | |||||||
REcursive Functions Algorithmic Language The "Russian Lisp", first implemented in 1968 (!). "Unlike Lisp, Refal is based on pattern matching. Due to that, a typical program in Refal is two or three times shorter, on the average, than the analogous program in Lisp, and much more readable. When compared with Prolog, Refal is conceptually simpler. Its pattern matching works in the forward direction, not backwards (starting from the goal), as in Prolog. This is a more natural approach to writing algorithms and makes them much easier to test and debug." ![]() ![]() ![]() Developed by Valentin Turchin. |
![]() ![]() ![]() So log in, fella — or finally get your langreiter.com account. You always wanted one. Nearby in the temporal dimension: Nobody. ... and 122 of the anonymous kind. Click on ![]() BACKLINKS none RECENT EDITS (MORE) ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() POWERED BY ![]() &c. GeoURL RSS 0.92 FRIENDLY SHOPS Uncut Games bei Gameware OFFEN! Offenlegung gem. §25 MedienG: Christian Langreiter, Langkampfen See also: Privacy policy. |