| Joy | |
| Paradigm: | multi-paradigm |
| Year: | 2001 |
| Designer: | Manfred von Thun |
| Developer: | Manfred von Thun John Cowan |
| Latest Release Version: | March 17, 2003 |
| Latest Release Date: | March 17, 2003 |
| Typing: | strong, dynamic |
| Implementations: | Joy0, Joy1, "Current Joy", "John Cowan's Joy", "JoyJ (Joy in jvmm)" |
| Influenced By: | Scheme, FP, Forth |
| Influenced: | Factor, Cat, V, Trith |
The Joy programming language in computer science is a purely functional programming language that was produced by Manfred von Thun of La Trobe 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 not to design but to an independent evolution and convergence. It was also inspired by the function-level programming style of John Backus's FP.[1]
Functions in Joy lack formal parameters. For example, a function that squares a numeric input can be expressed as follows:
DEFINE square
In Joy, everything is a function that takes a stack as an argument and returns a stack as a result. For instance, the numeral '5' does not represent an integer constant, but instead a short program that pushes the number 5 onto the stack.
So the square function makes a copy of the top element, and then multiplies the two top elements of the stack, leaving the square of the original top element at the top of the stack, with no need for a formal parameter. This makes Joy concise, as illustrated by this definition of quicksort:
<nowiki> DEFINE qsort == [small] [] [uncons [>] split] [enconcat] binrec. </nowiki>
Joy is a concatenative programming language: "The concatenation of two programs denotes the composition of the functions denoted by the two programs".[2]