*** Welcome to piglix ***

Joy (programming language)

Joy
Paradigm multi-paradigm: functional, concatenative, stack-oriented
Designed by Manfred von Thun
Developer Manfred von Thun, John Cowan
First appeared 2001
Stable release
March 17, 2003 / March 17, 2003
Typing discipline strong, dynamic
Major implementations
Joy0, Joy1, "Current Joy", "John Cowan's Joy", "JoyJ (Joy in jvmm)"
Influenced by
Scheme, FP
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 a sort of parallel evolution and convergence. It was also inspired by the function-level programming style of Backus's FP.

Joy is unusual (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):

The variable x is a formal parameter which is replaced by the actual value to be squared when the function is called. In a functional language (Scheme) the same function could be defined:

This is different in many ways, but it still uses the formal parameter x in the same way. In Joy the square function is defined:

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.


...
Wikipedia

...