Revision as of 06:45, 30 December 2009 edit Pcap (talk \| contribs) Pending changes reviewers, Rollbackers 18,285 edits Reverted good faith edits by EnTerr; Please explain on talk or edit summary why you deleted that. (TW) ← Previous edit		Revision as of 06:54, 30 December 2009 edit undo Pcap (talk \| contribs) Pending changes reviewers, Rollbackers 18,285 edits add a ref Next edit →
Line 1: '''Unlambda''' is a minimal, ~~but~~"nearly impure"<ref>http://scienceblogs.com/goodmath/2006/08/friday_pathological_programmin_3.php</ref> [[Functional programming language#Pure functions\|impure]] [[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. ==Basic principles==

Unlambda: Difference between revisions