Jump to content

Talk:Joy (programming language)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 14:17, 21 May 2009 (Signing comment by 79.46.167.236 - "No references/possible original research: new section"). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

I am currently (28.5.03) trying to do some deliberate convergence between Joy, Forth and Euphoria, and I may eventually borrow some insights from Oberon to help implement this. Interested readers can follow some progress reports on the Forth newsgroup or the Functional languages newsgroup. (I wonder if this external link trick will work for newsgroups?) PML.

I have just (25.6.03) put some documented work in progress for this project up on a page at my site, [1]. PML.

Why are there two pages for this? Joy_(programming_language) and this one. Since this is older maybe the other one's content should be copied here? -- Dv 06:18, 2004 Aug 2 (UTC)

I've merged Joy (programming language) with Joy programming language now. Angela. 20:11, Aug 2, 2004 (UTC)

Lambda calculus

Joy is the purest implementation of the lambda calculus as a programming language
Joy is based on composition of functions rather than lambda calculus

So, um, which way is it? Fredrik | talk 20:54, 12 Mar 2005 (UTC)

seems to be the second one; the homepage of its inventor say's:
Joy is a purely functional high level programming language which eliminates lambda abstraction and function application and replaces them by program quotation and function composition.
-- Wizzar 19:05, 6 May 2005 (UTC)[reply]

Side-by-side comparison for Quicksort?

I know there's already a comparison for square, but that's very simple, and, being an outsider, I can definitely say that the Quicksort algorithm shown is complete and utter Greek as far as I can tell. Perhaps someone could put in a side-by-side comparison with a more familiar language (such as C or Java), in such a way as to be able to see and understand what each part of the function means. --Dlevenstein 12:11, 30 May 2007 (UTC)[reply]

Mathematical purity

"the meaning function is a homomorphism from the syntactic monoid onto the semantic monoid" What does this mean? Lmatt 13:28, 5 June 2007 (UTC)[reply]

Appending words to the program composes the program with those new functions. But that's uninteresting---and true for most languages. Adding well-formed subprograms to the end of programs in C, Forth, most Lisps, Python, etc. adds new functions to the program. The monoid structure of the program isn't very interesting. It's the branching and looping structure inside the program that's interesting. —Preceding unsigned comment added by 80.67.64.10 (talk) 12:41, 9 March 2009 (UTC)[reply]

Plus, what's "mathematical purity" anyway? 213.243.143.189 (talk) 20:14, 23 September 2008 (UTC)[reply]

Bill Joy

Wonder if its named after Bill Joy ? 86.29.33.92 (talk) 18:50, 6 February 2008 (UTC)[reply]

No references/possible original research

The article doesn't cite any reference and it appears that it might be original research. Please provide references. —Preceding unsigned comment added by 79.46.167.236 (talk) 14:16, 21 May 2009 (UTC)[reply]