Unlambda is a minimal language of functional Programmation invented by David Madore. It is based on the principle of the Combinatory logic , a version of the Lambda-calculation which omits the operator lambda. It rests mainly on two integrated functions ( S and K ) and on an operator “apply” (written , the reversed quotation mark). It constitutes of this fact a Turing-complete language and comprises moreover some functions of i/o allowing an interaction with the user, various functions of short cuts and a function of lazy evaluation.

External bond

  • Web site of Unlambda

Random links:Yuan Longping | Shinya Tsukamoto | Transfinite: The Essential A.E. van Vogt | Thierry Acot-Mirande | Parabola | Sostratus_de_Cnidus

© 2007-2008 speedlook.com; article text available under the terms of GFDL, from fr.wikipedia.org