Unlambda: Difference between revisions

Revision as of 14:26, 30 December 2009

Latest revision as of 02:59, 11 August 2024

(34 intermediate revisions by 30 users not shown)

Line 1:

{{Refimprove|date=August 2020}}

'''Unlambda''' is a minimal, "nearly [[Purely functional|pure]]"<ref>http://scienceblogs.com/goodmath/2006/08/friday_pathological_programmin_3.php</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.

{{short description|Functional programming language}}

*[[Joy{{Infobox (programming language)|Joy]]

[[es:| name = Unlambda]]

| logo = <!-- (filename only) -->

| logo caption =

| screenshot = <!-- (filename only) -->

| screenshot caption =

| paradigm = Nearly [[Purely functional programming|pure]] [[Functional programming|functional]]

| family =

| designer = David Madore

| developer = David Madore

| released = {{Start date and age|1999|06|28|df=yes}}

| latest release version = 2.0.0

| latest release date = {{Start date and age|1999|12|20|df=yes}}

| latest preview version =

| latest preview date = <!-- {{Start date and age|YYYY|MM|DD|df=yes}} -->

| typing = [[Type system|Untyped]]

| scope =

| programming language = [[Scheme (programming language)|Scheme]], [[C (programming language)|C]], [[Java (programming language)|Java]]

| discontinued =

| platform =

| operating system =

| license = [[GNU General Public License|GPL]] 2.0 or later

| file ext =

| file format = <!-- or: | file formats = -->

| website = {{URL|www.madore.org/~david/programs/unlambda}}

| implementations =

| dialects =

| influenced by =

| influenced =

}}

'''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/friday_pathological_programmin_3.php11/friday-pathological-programmin-3/|publisher=ScienceBlogs}}</ref> [[functional programming language|functional]] [[programming language]] invented by [[David Madore]]. It is based on [[combinatory logic]], aan versionexpression ofsystem without the [[lambdaLambda calculus|lambda operator]] thator omitsfree the lambda operatorvariables. It relies mainly on two built-in functions (''<code>s''</code> and ''<code>k''</code>) and an "apply" operator (written ''<code>`''</code>, 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.

Unlambda is [[free and open-source software]] distributed under a [[GNU General Public License]] (GPL) 2.0 or later.{{clarify|date=March 2022}}

==Basic principles==

As an [[esoteric programming language]], Unlambda is meant as a demonstration of very pure functional programming rather than for practical use. Its main feature is the lack of conventional operators and data types &mdash; the only kind of data in the program are one-parameter functions. Data can nevertheless be simulated with appropriate functions as in the [[lambda calculus]]. Multi-parameter functions can be represented withvia the techniquemethod of [[currying]].

Unlambda is based aroundon the principle of [[abstraction elimination]], or the elimination of all saved variables, including functions. As a purely- functional language, not only are Unlambda's functions are [[first-class objectsobject]]s, theyand are the ''only'' first-classsuch objects.

AnHere is an implementation of thea [[hello world program]] in Unlambda follows:<ref name="chu2006"/>

`r```````````.H.e.l.l.o. .w.o.r.l.di

Line 13 ⟶ 47:

The notation <code>.''x''</code> denotes a function which takes one argument and returns it unchanged, printing the single character ''x'' as a side effect when it is invoked. <code>i</code> represents the version of the identity function that has no such side effect; it is used here as a dummy argument. The program <code>`.di</code> applies the <code>d</code>-printing function to a dummy argument of <code>i</code>, returning <code>i</code> and printing the letter <code>d</code> as a side effect. Similarly, <code>``.l.di</code> first applies <code>.l</code> to <code>.d</code>, printing the letter <code>l</code> and returning <code>.d</code>; this result of <code>.d</code> is then applied to <code>i</code> as in the previous example. The function <code>r</code> is [[syntactic sugar]] for the function that prints a newline character.

Other important features provided by Unlambda include the <code>k</code> and <code>s</code> functions. <code>k</code> manufactures constant functions: the result of <code>`k''x''</code> is a function which, when invoked, returns ''x''. Thus the value of <code>``k''xy''</code> is ''x'' for any ''x'' and ''y''.

<code>s</code> is a generalized evaluation operator. <code>```s''xyz''</code> evaluates to <code>``''xz''`''yz''</code> for any ''x'', ''y'', and ''z''. It is a remarkable fact that <code>s</code> and <code>k</code> are sufficient to perform any calculation;, seeas thedescribed in [[SKI combinator calculus]] article for full details. As a brief example, note that the identity function <code>i</code> can be implemented as <code>``skk</code>, since <code>```skk''x''</code> yields ''x'' for all ''x''.

Unlambda's one flow control constructionconstruct is [[call with current continuation]], denoted <code>c</code>. When an expression of the form <code>`c''x''</code> is evaluated, a special "''continuation"'' object is constructed, representing the state of the interpreter at that moment. Then ''x'' is evaluated, and then the result is given the continuation object as an argument. If the continuation is never applied to an argument, the value of the <code>`c''x''</code> expression is the same as the value of ''x''. But if the continuation object is applied to a value ''y'', execution of ''x'' is immediately aborted, and the value of the entire <code>`c''x''</code> expression is ''y''.

Although Unlambda's execution semantics are normally [[eager evaluation|eager]], there isbut a [[lazy evaluation]] option exists, indicated by the use of the <code>d</code> operator. Usually, to evaluate an expression of the form <code>`''xy''</code>, unlambda first evaluates ''x'', then ''y'', and then applies ''x'' to ''y''. However, if ''x'' evaluates to the special value <code>d</code>, then ''y'' is ''not'' evaluated; instead, the value of the expression <code>`d''y''</code> is a special "delayed computation" object, which, when applied to an argument ''z'', evaluates ''y'', and then applies its value to ''z''. Note that inIn the absence of side effects, this is exactly the same as <code>`i''y''</code>. The difference is that <code>`i''y''</code> executes any side effects in ''y'' immediately, whereas <code>`d''y''</code> defers the side effects until the result is applied to another argument.

Unlambda's next built-in operator is <code>v</code>, which ignores its argument and returns <code>v</code>. This feature is not strictly necessary, since <code>v</code> could be implemented as <code>```s``k``sii``s``s`kskkskk`k``siiks``s`kskk</code>, but it is supplied as a convenience. (This expression above is simply <code>`Yk</code>, where <code>Y</code> denotes a [[fixed point combinator]].)

==UnlambdaVersion 2 built-in functions==

AdditionalMore built-ins were introduced in Unlambda version 2 of the Unlambda language. [[Input/output|Input]] in Unlambda is facilitated by operators <code>@</code> and <code>?''u''</code>. When <code>@</code> is applied to a function ''x'', a character is read from input, and stored as the "current character"; then ''x'' is applied to <code>i</code>. However, if no more characters were available on input, the "''current character"'' is left undefined, and ''x'' is applied to <code>v</code> instead. When a function <code>?''u''</code> is applied to a function ''x'', the result is the evaluation of <code>`''x''i</code> if the current character is ''u'', otherwise <code>`''x''v</code> is evaluated.

There is also a "reprint" operator <code>|</code>. When <code>`|''x''</code> is evaluated, the function ''x'' is applied to <code>.''u''</code> if ''u'' is the current character, or to <code>v</code> if there is no current character.

Line 31 ⟶ 65:

==See also==

Similar languages:

*[[Iota and Jot]]

*[[SKI combinator calculus]]

*[[Joy (programming language)|Joy]]

==References==

{{reflistReflist}}

* Felix-Hernandez Campos (1 April 2002), ''[http://www.cs.unc.edu/~stotts/144/lectures/lect28apr.pdf Lecture 28: More on functional programming]'', University of North Carolina COMP144

* {{cite book |url=httphttps://books.google.com/books?id=LlR6__OpAxoC&pg=PA205&dq=Unlambda&cd=2#v=onepage&q=%22Unlambda%22&fpg=falsePA205 |title=Rubyで作る奇妙なプログラミング言語 |language=Japanese |author=原 悠 (Yutaka Hara)|pagepages=205&ndash;214205–214|isbn=4839927847978-4-8399-2784-4|publisher=Tōkyō: Mainichikomyunikēshonzu|year=2008}}

==External links==

*[http://{{Official website|www.madore.org/~david/programs/unlambda/ Unlambda homepage]}}

[[Category:Esoteric programming languages]]

[[Category:Functional languages]]

{{Esoteric programming languages}}

[[es:Unlambda]]

[[fr:Unlambda]]

[[hu:Unlambda]]

[[pl:Unlambda]]

[[pt:Unlambda]]

[[ru:Unlambda]]