Joy programming language
|
|
The Joy programming language is a simple functional programming language that was produced by Manfred von Thun of Latrobe University in Melbourne, Australia. Joy is based on composition of functions rather than lambda calculus. It has turned out to have many similarities to Forth, due less to design than to a sort of parallel evolution and convergence.
Joy is almost unique (except for Function-level programming languages and some esoteric ones, such as unlambda) in its lack of a lambda operator, and therefore lack of formal parameters. To illustrate this with a common example, here is how the square function might be defined in an imperative programming language (C):
int square(int x) {
return x*x;
}
The variable x is a formal parameter which is replaced by the actual value to be squared when the function is called. Now here's how the same function would be defined in a functional language (scheme):
(define square
(lambda (x)
(* x x)))
This is different in many ways, but it still uses the formal parameter x in the same way. Now here is how the square function would be defined in joy:
DEFINE square == dup * .
That probably requires some explanation. In joy, everything is a function that takes a stack as an argument and returns a stack as a result. For instance, the number 5 is not, as it might appear to be, an integer constant, but instead a short program that pushes the number 5 onto the stack. The + operator pops two numbers off the stack and pushes their sum. The dup operator simply duplicates the top element of the stack by pushing a copy of it. So this definition of the square function says to make a copy of the top element and then multiply the two top elements, leaving the square of the original top element on top of the stack. There is no need for a formal parameter at all. This design makes joy one of the most powerful and concise languages, as illustrated by this definition of quicksort:
DEFINE qsort == [small] [] [uncons [>] split] [[swap] dip cons concat] binrec .
"binrec" is one of joy's many recursive combinators, 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 beautiful aspects of joy is this: the meaning function is a homomorphism from the syntactic monoid onto the semantic monoid. The syntactic relation of concatenation of symbols maps directly onto the semantic relation of composition of 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 is the purest implementation of the lambda calculus as a programming language, but it still manages to be practical and potentially useful, unlike the otherwise similar unlambda.
External link
- Joy homepage (http://www.latrobe.edu.au/philosophy/phimvt/joy.html)de:Joy