
	Where results make sense

Topic: Unlambda

Related Topics

Utamaro

Chih Nu

4660 Nereus

Lenaia

1966 in aviation

De Tomaso

USS Chester

Plastic surgery

ASMSU

Mariner 10

Edison

92

Volga

Basarab I

In the News (Sun 29 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Unlambda - Wikipedia, the free encyclopedia
		Unlambda is a minimal functional programming language invented by David Madore.
		As an esoteric programming language, Unlambda is meant as a demonstration of very pure functional programming rather than for practical use.
		Unlambda is based around the principle of abstraction elimination, or the elimination of all saved variables, including functions.
	en.wikipedia.org /wiki/Unlambda_programming_language (623 words)

	Unlambda -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-11-05)
		As an (Click link for more info and facts about esoteric programming language) esoteric programming language, Unlambda is meant as a demonstration of very pure functional programming rather than for practical use.
		Unlambda's one flow control construction is (Click link for more info and facts about call with current continuation) call with current continuation, denoted
		Although Unlambda's execution semantics are normally (A high wave (often dangerous) caused by tidal flow (as by colliding tidal currents or in a narrow estuary)) eager, there is a (Click link for more info and facts about lazy evaluation) lazy evaluation option, indicated by the use of the
	www.absoluteastronomy.com /encyclopedia/U/Un/Unlambda.htm (722 words)

	unlambda (Site not responding. Last check: 2007-11-05)
		Unlambda is a minimal functional programming language based on combinatory logic, a version of the lambda calculus that omits the lambda operator.
		It relies mainly on two builtin 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.
		The hello, world program in Unlambda is somewhat odd.
	www.yourencyclopedia.net /unlambda.html (231 words)

	Unlambda
		The number one principle of the Unlambda language is that everything is a function: this is true in the sense that Unlambda is a profile of the pure untyped lambda calculus.
		Although the very idea of a tutorial for such an obfuscated language as Unlambda is patently absurd, I shall try to give a brief introduction to the concepts before dwelling in the details of the reference section (which is also very short considering how small Unlambda is as a whole).
		Since all Unlambda functions take exactly one argument, when we wish to handle a function of several arguments, it is necessary to ``curry'' that function.
	shrike.depaul.edu /~csweeney/unlambda3.html (6878 words)

	Unlambda (Site not responding. Last check: 2007-11-05)
		Unlambda is a computer language in the style of INTERCAL, but in the functional vein instead of imperative.
		This I did, becoming convinced in the process that Unlambda really, really should have been made lazy-evaluation instead of eager — the side-effect of infinite recursion means you can't use a lot of the beautiful constructs of Combinator Calculus.
		Then I stumbled back on Madore's Unlambda pages, where he stated that no-one had yet written an Unlambda interpreter in Unlambda, though it should be theoretically possible, and I was hooked again, until I finished my Unlambda-in-Unlambda, which compliments my Unlambda-in-C interpreter by instead being the least efficient Unlambda interpreter out there.
	www.ofb.net /~jlm/unlambda/unlambda.html (293 words)

	The Unlambda Programming Language
		It is not fundamentally difficult, being mainly a question of applying abstraction elimination to expressions of the untyped lambda calculus (of course, obtaining these expressions in the first place is not necessarily evident); if you're messy it will turn into a nightmare.
		First-class functions, as noted earlier, have to be replaced by the appropriate data structures, both in the handling of the Unlambda functions themselves, and in the handling of the Unlambda continuations.
		Unlambda can certainly be compiled in Unlambda at least, by the identity function.
	www.madore.org /~david/programs/unlambda (7293 words)

	Unlambda in K
		Unlambda was intended as an "obfuscated" programming language: the elements are difficult to understand; and, once understood, are difficult to use as the building blocks of non-trivial programs.
		Second, the presence of lazy evaluation and continuations, apart from serving the author's goal of obfuscating the Unlambda language proper, presents interesting difficulties in the implementation of an Unlambda interpreter in a language which lacks those features.
		A second goal is to shed light on the concepts of Unlambda from a purely algorithmic point of view.
	www.nsl.com /papers/unlambda.htm (3629 words)

	The Lazy K Programming Language
		Unlambda would seem to be the natural candidate for that position.
		The Unlambda page states that a functional programming language is one in which functions have first-class citizenship.
		In Unlambda, every program which is statically valid is also dynamically valid: that is, there is no possibility of a run-time error (other than nontermination or memory exhaustion).
	homepages.cwi.nl /~tromp/cl/lazy-k.html (3284 words)

	Lazy K - Wikpedia (Site not responding. Last check: 2007-11-05)
		This language is much more minimalistic than Unlambda, the most famous functional esoteric programming language.
		Compared to Unlambda's seven primitive functions, Lazy K manages with only three predefined combinators: S, K, and I.
		A complete Unlambda interpreter written in Lazy K is ten times shorter than an equivalent Unlambda interpreter written in Unlambda.
	www.bostoncoop.net /~tpryor/wiki/index.php?title=Lazy_K (203 words)

	[acm-talk] A fun language for those of you struggling with ml... (Site not responding. Last check: 2007-11-05)
		Taking it's lead from such hideous constructs as Malbolge[1] and C-Intercal[2] (soon to be threaded, with operator overloading), obfuscated languages have reached a new [peakdepth] with unlambda.
		Unlambda is a very simply strictly functional language.
		Basically, unlambda is a straight implementation of the untyped lamda calculus, but without the lambda.
	acm.cwru.edu /pipermail/acm-talk/2001-March/000049.html (204 words)

	Meditations on the Void (Site not responding. Last check: 2007-11-05)
		Unlambda is an eager implementation of a programming language based on the S, K, and I combinators from Combinatory logic.
		Programming in general is hard work, but Unlambda makes that work even harder with its applicative (vice normal) order and with its indirect form of abstraction.
		Programming in Unlambda is challenging, but it is also rewarding.
	www.cotilliongroup.com /code/void-meditations.html (1503 words)

	CodingForums.com - CHALLENGE: The 2004 summer challenge
		Your reference for this will be The Unlambda Programming Language.
		Unlambda is a small language with a deciviously simple looking set of commands.
		- Return an array consisting of the evaluation of the Unlambda program and a string representing the STDOUT output, alternatively returning just the evaluation and instead alerting the output.
	www.codingforums.com /printthread.php?t=40156 (297 words)

	Emil Jerabek - not seriously (Site not responding. Last check: 2007-11-05)
		unl.c: this one is written in C. It is the fastest Unlambda interpreter I know about, and it is also less buggy than other C based Unlambda interpreters.
		The first one is as simple as possible, it may serve as an inspiration if you want to write an interpreter yourself (in fact, all of my Unlambda interpreters are based on this one).
		It understands new primitive functions "t" and "n", which behave as "i", except that `tF evaluates the form F in a tracing mode, while `nF disables tracing during evaluation of F. unl.pl: this one is written in Perl, and is not particularly interesting.
	artax.karlin.mff.cuni.cz /~ejer5183/ptakoviny.html (273 words)

	[No title] (Site not responding. Last check: 2007-11-05)
		# unlambda v1 interpreter in sed # 2003-02-19 - Laurent Vogel - !http://lvogel/free.fr # GPL version 2 or later (see http://www.gnu.org/copyleft/gpl.html) # This is an interpreter for unlambda version 1.
		# Unlambda is an esoteric language invented by David Madore in 1999.
		the unlambda state was # {A}`c{expr}{B}) # Continuations are deleted when no longer referenced, but the # unique identifier remains in the base in the form [i] ready # to be re-used to serve as the unique identifier of another # continuation.
	sed.sourceforge.net /local/scripts/unlambda.sed (1605 words)

	A bit of Unlambda... (Site not responding. Last check: 2007-11-05)
		Here are some programs I have written, in Unlambda 2.0.
		spirou $ unlambda unlambdaify.unl ^x^y$x k spirou $ unlambda unlambdaify.unl ^x$x i spirou $ unlambda unlambdaify.unl ^x^y```$y$x$y$x ``s``s`ks``s``s`ks``s`k`sik`kik
		Here is a Scheme program for translating Scheme to Unlambda (actually, only a tiny sublanguage of Scheme is understood, but it's already very powerful).
	www.eleves.ens.fr /home/wittenbe/unlambda.html.en (137 words)

	Bug#148638: marked as done (ITP: unlambda -- Tiny functional programming language using combinators)
		Your message dated Tue, 11 Jun 2002 19:27:51 -0400 with message-id and subject line Bug#148638: fixed in unlambda 2.0.0-2 has caused the attached Bug report to be marked as done.
		This means that you claim that the problem has been dealt with.
		Thank you for reporting the bug, which will now be closed.
	lists.debian.org /debian-wnpp/2002/06/msg00170.html (321 words)

	Unlambda - Esolang (Site not responding. Last check: 2007-11-05)
		Please help us by adding some more information.
		Unlambda, designed by David Madore, is a minimal functional esoteric programming language based on combinatory logic.
		It is Turing-complete thanks to its built-in s and k combinators and the apply operator, ` (backquote).
	www.esolangs.org /wiki/Unlambda (63 words)

	Relative clauses and lambda calculus
		I've been thinking that relative clauses are just like functions in lambda calculus, and that abstraction could be eliminated using the S, K and I combinators.
		Suppose we have a language where roots are isolated and the only thing one can do is "applying" a root to another root.
		These kilometric expressions make me believe this is probably violating a language universal, in the sense that it is counter-intuitive.
	www.angelfire.com /oz/kube/relative.html (1177 words)

	Fun with call/cc (was RE: [Python-Dev] Stackless Python - Pros and Cons) (Site not responding. Last check: 2007-11-05)
		At least some of them appear to be addressing Kent Pitman's specific complaints about the excruciating interactions between call/cc and unwind-protect in Scheme.
		Don't know why I haven't bumped into it before: http://www.eleves.ens.fr:8080/home/madore/programs/unlambda/ "Your Functional Programming Language Nightmares Come True" Unlambda is a deliberately obfuscated functional programming language, whose only data type is function and whose only syntax is function application: no lambdas (or other "special forms"), no integers, no lists, no variables, no if/then/else,...
		call/cc is spelled with the single letter "c" in Unlambda, and the docs note "expressions including c function calls tend to be hopelessly difficult to track down.
	mail.python.org /pipermail/python-dev/2000-August/008015.html (430 words)

	LtU Classic Archives
		Second, I made a revised Combinator Calculator that is lifted from the Combinatory Logic Tutorial with modifications to support the birds beyond the Starling and Kestrel.
		Finally, I wrote a Partial Unlambda Interpreter that is a stripped down version of the Unlambda Programming Language
		There is a discussion on how to do this conversion in the documentation for Unlambda http://www.eleves.ens.fr:8080/home/madore/programs/unlambda/#lambda_elim.
	lambda-the-ultimate.org /classic/message6578.html (381 words)

	[No title] (Site not responding. Last check: 2007-11-05)
		For one thing, the trick of using the star prefix instead of left and right parentheses is a strategy also adopted in Unlambda.
		In addition, it is easy to find a meaning-preserving mapping from Iota into CL: the semantics in the definition for Iota are given as a mapping from Iota to the lambda calculus, and there are well-known techniques for mapping the lambda calculus into CL (see, e.g., Hankin or the Unlambda page for details).
		This program also denotes an infinite loop, but with a difference: the equivalent lambda expression reduces to an expression that is longer than the original.
	evil-wire.luvfeed.org /cache/4770 (1825 words)

	LinkPage031002 - Random - b r a y d e n . o r g
		Unlambda uses a functional approach to programming: the only form of objects it manipulates are functions.
		Despite all these apparently unsurmountable limitations, Unlambda is fully Turing-equivalent.
		The following Unlambda program calculates and prints the Fibonacci numbers (as lines of asterisks)
	www.brayden.org /twiki/bin/view/Random/LinkPage031002 (414 words)

	Uncle Jazzbeau’s Gallimaufrey: just say unlambda
		If you were confused by Befunge with its 2D programmer counter, then get ready for Unlambda [via Irrefragable] which has no variables and only manipulates functions.
		It claims to be Turing complete and most probably is. Consider the following Unlambda program:
		It "prints the Fibonacci numbers (as lines of asterisks)." There's something both healthy and unhealthy about obfuscated programming languages, and I must admit I like them as a sort of conceptual art.
	www.bisso.com /ujg_archives/000121.html (82 words)

	[No title] (Site not responding. Last check: 2007-11-05)
		The idea is to make functions that have the behavior of the unlambda operators, 13:52:31
		Rather than an "interpreter" function that evaluates by reading some unlambda code and performing its behavior 13:53:03
		I've written a working unlambda to scheme compiler that has no bundled unlambda interpreter 19:21:53 --- quit: heatsink ("Client Exiting") 22:37:00 --- quit: lament ("Leaving") 23:59:59 --- log: ended esoteric/04.04.25
	tunes.org /~nef/logs/esoteric/04.04.25 (253 words)

	Lambda - Open Encyclopedia (Site not responding. Last check: 2007-11-05)
		The definition of anonymous functions in lambda calculus and, by extension, some programming languages
		The language Unlambda is made up completely of lambdas, but they cannot be stored, hence the un-.
		Air to fuel ratio in an internal combustion engine
	open-encyclopedia.com /Lambda (118 words)

	Anthony Lorelli
		I will attempt to solve the problem using Unlambda.
		How to make a Word doc that shows one thing when viewed on screen, but something different when printed.
		My fellow Chicoans at SciTech Software have announced their intent to GPL a large chunk of their device driver development software.
	radio.weblogs.com /0105841/2002/08/29.html (111 words)

	[No title] (Site not responding. Last check: 2007-11-05)
		The macro interpreter would pass characters to the basic interpreter, which could do whatever it wants with them (e.g.
		The basic interpreter could remember states of the macro interpreter, and could ask the macro interpreter to resume from these states.
		in Brainfunct, when we meet a '[' we want to be able to get back to it.) Then we could replace the underlying BrainFunct interpreter with: (1) a BrainFunct, Unlambda,...
	www.pimpworks.org /brainfuck/utils/eso_bfm/bfm-projects.txt (282 words)

	CTO : Unlambda (Site not responding. Last check: 2007-11-05)
		unlambda is a torture of a programming language invented by David Madore.
		unlambda is an applicative combinatory programming language with terminal I/O. In unlambda, you program with a finite set of builtin higher-order combinators (nullary constructors) and application (prefix binary operator), and that's all.
		CTO pages can be modified by anyone at anytime.
	cliki.tunes.org /Unlambda (62 words)

	Re: I love Ruby
		Probably all of this are just unlambda done properly :) > >FYI, I have written a unlambda interpreter in Ruby.
		>But you don't have very large unlambda programs that you absolutely >need to run, do you?
		:))) I wa thinking to write an unlambda interpreter just after my exams' session, end of july ;) Damn, now I have to write the COW one..
	blade.nagaokaut.ac.jp /cgi-bin/scat.rb/ruby/ruby-talk/105719 (162 words)

Try your search on: Qwika (all wikis)