Unlambda: Difference between revisions

Revision as of 12:45, 22 December 2016

Revision as of 00:00, 14 January 2017

Line 1:

'''Unlambda''' is a minimal, "nearly [[Purely functional language|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]] 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 "<code>apply"</code> operator (written ''`'', the [[backquote]] character). These alone make it [[Turing-complete]], but there are also some [[input/output]] (I/O) functions to make it possible toenable interactinteracting with the user, some shortcut functions, and a function for [[lazy evaluation]] function. ThereVariables are no variables in the languageunsupported.

==Basic principles==