Category:Joy: Difference between revisions

From Rosetta Code
Content added Content deleted
(Added features)
m (Remove extra cat link)
Line 4: Line 4:
|checking=dynamic}}'''Joy''' is a [[functional programming]] language based on combinators rather than lambda expressions. This gives it a postfix syntax, similar to [[Forth]], although the semantics are quite different.
|checking=dynamic}}'''Joy''' is a [[functional programming]] language based on combinators rather than lambda expressions. This gives it a postfix syntax, similar to [[Forth]], although the semantics are quite different.
*[http://www.latrobe.edu.au/philosophy/phimvt/joy.html Joy homepage]
*[http://www.latrobe.edu.au/philosophy/phimvt/joy.html Joy homepage]

[[Category:Solutions by Programming Language]]

Revision as of 01:46, 6 June 2009

Language
Joy
This programming language may be used to instruct a computer to perform a task.
Type safety: Safe
Type strength: Strong
Type checking: Dynamic
See Also:


Listed below are all of the tasks on Rosetta Code which have been solved using Joy.

Joy is a functional programming language based on combinators rather than lambda expressions. This gives it a postfix syntax, similar to Forth, although the semantics are quite different.

Subcategories

This category has the following 3 subcategories, out of 3 total.

Pages in category "Joy"

The following 90 pages are in this category, out of 90 total.