Category:Joy: Difference between revisions

From Rosetta Code
Content added Content deleted
(+{{language programming paradigm|concatenative}})
m (Change site, add hopl id.)
Line 1: Line 1:
{{language|Joy
{{language
|strength=strong
|strength=strong
|safety=safe
|safety=safe
|checking=dynamic
|checking=dynamic
|site=http://www.latrobe.edu.au/philosophy/phimvt/joy.html
|site=http://www.latrobe.edu.au/phimvt/joy.html
|hopl id=2137
|LCT=yes}}
|LCT=yes}}
{{language programming paradigm|concatenative}}
{{language programming paradigm|concatenative}}

Revision as of 22:53, 24 November 2011

Language
Joy
This programming language may be used to instruct a computer to perform a task.
Official website
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.