Joy (programming language)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
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
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.[1]

How it works[edit]

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):

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. In a functional language (Scheme) the same function could be defined:

(define square
  (lambda (x) 
    (* x x)))

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:

DEFINE square == dup * .

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.

  • The dup operator simply duplicates the top element of the stack by pushing a copy of it.
  • The * operator pops two numbers off the stack and pushes their product.

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:

 DEFINE qsort ==
   [uncons [>] split]

"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[edit]

In Joy, the meaning function is a homomorphism from the syntactic monoid onto the semantic monoid. That is, 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.

In other words, it is a concatenative programming language: "The concatenation of two programs denotes the composition of the functions denoted by the two programs".[2]

Its library routines mirror those of ISO C, though the current implementation is not easily extensible with functions written in C.


  1. ^ Manfred von Thun (December 12, 2003). "A Conversation with Manfred von Thun". Retrieved May 31, 2013. In the early 1980's I came across the famous Backus paper "Can programming be liberated from the von Neumann style," and I was immediately intrigued by the higher level of programming in his FP. 
  2. ^ "Mathematical Foundations of Joy". 

External links[edit]