1. Various introductions to Joy
These introductions contain some common material.
Synopsis of the language Joy
(1K)A one-page introduction
Frequently Asked Questions about Joy
(24K) for programmers
Joy: Forth's Functional Cousin
includes comparisons with Forth
Apter interviews von Thun
in APL journal Vector
(if unsuccessful, follow "weblog" link towards end)
Rationale
for Joy (65K), for theoretical computer scientists
Overview
of Joy (27K), introductory sections of other papers.
You don't like theory? Try the tutorial below.
2. Papers on Joy
1.
Tutorial on Joy
Revised 11-Feb-03 (47K)
2.
Mathematical Foundations
of Joy (50K)
3.
Atomic Programs
of Joy (48K)
4.
The Algebra
of Joy (56K)
5.
Recursion Theory
and Joy (60K)
6.
Programming
in Joy (80K)
7.
A rewriting system
for Joy (57K)
8.
Joy compared
with other functional languages (46K)
9.
The current implementation
Revised 23-APR-03 (41K)
The following are produced automatically and always up to date:
plain-manual
The online manual for Joy primitives (text format)
html-manual
The same (html format)
List of primitive and currently defined library functions
(by "help." command, all libraries loaded)
(External)
Nick Forde's documentation library
(External)
The Theory of Concatenative Combinators
An algebraic treatment, by Brent Kerby (2002)
A collection of diverse examples of program development in Joy:
Design of a Joy interpreter written in Joy
Programs from the above (with additions)
jp-joyjoy.joy
jp-joytst.joy
test and
jp-joytst.out
(VMS: NOBDW) output
Design of matrix multiplication programs
Imperative thinking for Joy programs
Church arithmetic and Church logic
with Brent Kirby, and
jp-church.joy
the source.
Nested Recursion
and a new recursion combinator.
Fast small truth tables
(using Joy native sets)
The annoying quadratic formula
Lazy lists as reproducing programs
Survey of reproducing programs
Floy - a flat concatenative subbset of Joy
Joy bibliography