Unlambda: Difference between revisions

Revision as of 10:16, 1 July 2014

Revision as of 17:12, 7 July 2015

Line 1:

'''Unlambda''' is a minimal, "nearly [[Purely functional|pure]]"<ref name="chu2006">{{cite web|work=Good Math, Bad Math ''(blog)''|first=Mark C.|last=Chu-Carroll|date=2006-08-11|title=Friday Pathological Programming: Unlambda, or Programming Without Variables|url=http://scienceblogs.com/goodmath/2006/08/11/friday-pathological-programmin-3/|publisher=ScienceBlogs}}</ref> [[functional programming language|functional]] [[programming language]] invented by [[David Madore]]. It is based on [[combinatory logic]], a version of the [[lambda calculus]] that omits the lambda operator. It relies mainly on two built-in functions (''s'' and ''k'') and an "apply" operator (written ''`'', the [[backquote]] character). These alone make it [[Turing-complete]], but there are also some I/O functions to make it possible to interact with the user, some shortcut functions and a function for lazy evaluation. There are no variables in the language.

==Basic principles==