Joy (programming language): Difference between revisions

Revision as of 13:55, 1 October 2006

Revision as of 01:17, 19 October 2006

Line 46:

</pre>

"binrec" is one of Joy's many [[recursion|recursive]] [[combinator|combinators]]s, implementing binary recursion. It expects four quoted programs on top of the stack which represent the termination condition (if a list is "small" (1 or 0 elements) it is already sorted), what to do if the termination condition is met (in this case nothing), what to do by default (split the list into two halves by comparing each element with the pivot), and finally what to do at the end (insert the pivot between the two sorted halves).

== Mathematical purity ==

One of the most appealing aspects of Joy is this: the [[meaning]] function is a [[homomorphism]] from the [[syntax|syntactic]] [[monoid]] onto the [[semantics|semantic]] [[monoid]]. That is, the syntactic relation of [[concatenation]] of [[symbol|symbols]]s maps directly onto the semantic relation of [[Function composition|composition]] of [[function (mathematics)|functions]]. It is a [[homomorphism]] instead of an [[isomorphism]] because it is [[onto]] but not [[one-to-one]], that is, some sequences of symbols have the same meaning (e.g. "dup +" and "2 *") but no symbol has more than one meaning.

Joy manages to be practical and potentially useful, unlike the otherwise similar [[Unlambda]]. Its library routines mirror those of ISO [[C programming language|C]], though the current implementation is not easily extensible with functions written in C.