Revision as of 19:31, 3 September 2007 edit 78.48.8.49 (talk) No edit summary ← Previous edit		Revision as of 10:39, 4 October 2007 edit undo Novakreo (talk \| contribs) 128 edits m fix name of La Trobe University Next edit →
Line 15: }} The '''Joy programming language''' is a purely [[functional programming language]] that was produced by Manfred von Thun of [[~~Latrobe~~La Trobe University]] in [[Melbourne]], [[Australia]]. Joy is based on composition of functions rather than [[lambda calculus]]. It has turned out to have many similarities to [[Forth (programming language)\|Forth]], due less to design than to a sort of parallel evolution and convergence. Joy is unusual (except for [[function-level programming]] languages and some esoteric ones, such as [[unlambda]]) in its lack of a [[lambda calculus\|lambda]] operator, and therefore lack of [[Parameter (computer science)\|formal parameters]]. To illustrate this with a common example, here is how the square function might be defined in an [[imperative programming language]] ([[C (programming language)\|C]]):

Joy (programming language): Difference between revisions