Category:Joy: Difference between revisions
Content added Content deleted
(Move site to lang template, add paradigm) |
m (LCT link) |
||
| Line 3: | Line 3: | ||
|safety=safe |
|safety=safe |
||
|checking=dynamic |
|checking=dynamic |
||
|site=http://www.latrobe.edu.au/philosophy/phimvt/joy.html |
|site=http://www.latrobe.edu.au/philosophy/phimvt/joy.html |
||
|LCT=yes}} |
|||
{{language programming paradigm|Functional}}'''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. |
{{language programming paradigm|Functional}}'''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. |
||
Revision as of 15:18, 7 October 2009
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: |
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.
@
- Joy examples needing attention (empty)
- Joy Implementations (empty)
- Joy User (6 P)
Pages in category "Joy"
The following 90 pages are in this category, out of 90 total.
A
C
F
G
H
Q
R
S
- Show the epoch
- Singly-linked list/Traversal
- Sorting algorithms/Quicksort
- String case
- String concatenation
- String length
- Strip a set of characters from a string
- Substring/Top and tail
- Sum and product of an array
- Sum digits of an integer
- Sum multiples of 3 and 5
- Sum of a series
- Sum of squares
- System time