JOY Programming Language Help For Students

Introduction to JOY language

The Joy programming language in computer science is a purely functional programming language that was produced by Manfred von Thun of La Trobe in Melbourne Australia. Joy is based on the composition of functions. All such functions take a stack as argument and produce a stack as value. It does not use lambda-abstraction of expressions but instead it uses quotation of expressions. A large number of combinatory are used to perform DE quotation, they have the effect of higher order functions. Several of them can be used to eliminate recursive definitions. Programs in Joy are compact and often look just like postfix notation.

Example: Hello world!

{`
Hello, world!\n" putchars .
`}

{`
int square(int x)
{

return x * x;
}
`}