Content deleted Content added
No edit summary |
Another reference |
||
| (35 intermediate revisions by 23 users not shown) | |||
Line 1:
{{Old AfD multi |page1=Joy (programming language)|date1=12 February 2011 |page2=Joy (programming language) (2nd nomination) |date2=27 February 2011}}
I am currently (28.5.03) trying to do some deliberate convergence between Joy, [[Forth]] and [[Euphoria programming language|Euphoria]], and I may eventually borrow some insights from [[Oberon]] to help implement this. Interested readers can follow some progress reports on the [news:comp.lang.forth Forth newsgroup] or the [news:comp.lang.functional Functional languages newsgroup]. (I wonder if this external link trick will work for newsgroups?) PML.▼
{{WikiProject banner shell|class=Start|
{{WikiProject Software
|importance=low
|computing-importance=low
}}
}}
== Untitled ==
▲I am currently (28.5.03) trying to do some deliberate convergence between Joy, [[Forth (programming language)|Forth]] and [[Euphoria programming language|Euphoria]], and I may eventually borrow some insights from [[Oberon]] to help implement this. Interested readers can follow some progress reports on the [news:comp.lang.forth Forth newsgroup] or the [news:comp.lang.functional 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, [http://users.netlink.com.au/~peterl/furphy.html]. PML.
Line 13 ⟶ 23:
So, um, which way is it? [[User:Fredrik|Fredrik]] | [[User talk: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.''
:-- [[User:Wizzar|Wizzar]] 19:05, 6 May 2005 (UTC)
== 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. --[[User:Dlevenstein|Dlevenstein]] 12:11, 30 May 2007 (UTC)
== Mathematical purity ==
"the meaning function is a homomorphism from the syntactic monoid onto the semantic monoid"
What does this mean? [[User:Lmatt|Lmatt]] 13:28, 5 June 2007 (UTC)
: 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. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/80.67.64.10|80.67.64.10]] ([[User talk:80.67.64.10|talk]]) 12:41, 9 March 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
Plus, what's "mathematical purity" anyway? [[Special:Contributions/213.243.143.189|213.243.143.189]] ([[User talk:213.243.143.189|talk]]) 20:14, 23 September 2008 (UTC)
: Mathematical purity, that is to call a programming "pure", means that application of functions are free from side-effects. They don't change any state except the ones within their scope. A typical example of non-pure function is random number seeding and generation. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/60.249.196.111|60.249.196.111]] ([[User talk:60.249.196.111|talk]]) 02:08, 14 May 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->
== Bill Joy ==
Wonder if its named after [[Bill Joy]] ? [[Special:Contributions/86.29.33.92|86.29.33.92]] ([[User talk:86.29.33.92|talk]]) 18:50, 6 February 2008 (UTC)
== No references/possible original research ==
The article doesn't cite any reference and it appears that it might be original research.
Please provide references. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/79.46.167.236|79.46.167.236]] ([[User talk:79.46.167.236|talk]]) 14:16, 21 May 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:There are now 4 references. Would that be enough? [[User:Wodan58|Wodan58]] ([[User talk:Wodan58|talk]]) 08:32, 4 October 2024 (UTC)
== Official Joy Programming Language Website (La Trobe University) ==
Manfred von Thun, inventor of Joy, has passed away some time ago,[http://hosted.verticalresponse.com/291390/14a69b5ba4/1473484945/be83724914/#news][http://concatenative.org/wiki/revision/2572] and apparently his "[http://www.latrobe.edu.au/phimvt/joy.html Official Joy Programming Language Website]" at La Trobe University is no longer online. Kevin Albrecht's [http://www.kevinalbrecht.com/code/joy-mirror/index.html mirror] still appears to work, however. —[[User:Tobias Bergemann|Tobias Bergemann]] ([[User talk:Tobias Bergemann|talk]]) 14:55, 6 January 2013 (UTC)
== Other programming languages named Joy ==
Apart from the language documented here, there is another programming language named Joy that I am somewhat familiar with. It is a dialect of [[Occam]], which was used for description of self-timed silicon circuits. I'm not aware of any current development, nor any commercial releases, but its use was extensively documented in academic literature.
For example:
http://dspace.library.cornell.edu/handle/1813/7223
http://www.cs.indiana.edu/~geobrown/fac98.pdf
http://www.doc.ic.ac.uk/~wl/papers/async94.pdf <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/67.255.4.221|67.255.4.221]] ([[User talk:67.255.4.221|talk]]) 01:17, 8 January 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->
== Influenced by Forth ==
Although the introduction suggests that Joy is the result of an independent convergent evolution, it is common knowledge that stack-based programming languages have a long history, with Forth being an important development (late 60s/early 70s). It's unlikely for a computer scientist (or language developer) to not be aware of Forth and to not have been exposed to other stack-based languages such as Postscript (itself influenced by Forth); especially if developing a language with such striking similarities. Shouldn't the infobox consequently include Forth under "Influenced by"? [[Special:Contributions/76.10.128.192|76.10.128.192]] ([[User talk:76.10.128.192|talk]]) 00:11, 19 March 2015 (UTC)
== What does the period in the example do? ==
In the example code, {{code|DEFINE square {{=}}{{=}} dup * .}}, it is explained what the {{code|dup}} and {{code|*}} operators do, but it isn't explained what the {{code|.}} does. So, what does it do? This should probably be added to the article. —[[User:Kri|Kri]] ([[User talk:Kri|talk]]) 19:00, 9 September 2015 (UTC)
. outputs the value from the return stack (evaluates the expression and displays the result) and returns a new line in the interpreter, as in Forth <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/75.75.152.187|75.75.152.187]] ([[User talk:75.75.152.187#top|talk]]) 05:18, 27 September 2016 (UTC)</small> <!--Autosigned by SineBot-->
== External links modified ==
Hello fellow Wikipedians,
I have just modified {{plural:1|one external link|1 external links}} on [[Joy (programming language)]]. Please take a moment to review [https://en.wikipedia.org/w/index.php?diff=prev&oldid=713120645 my edit]. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit [[User:Cyberpower678/FaQs#InternetArchiveBot|this simple FaQ]] for additional information. I made the following changes:
*Corrected formatting/usage for http://www.latrobe.edu.au/phimvt/joy/j02maf.html
When you have finished reviewing my changes, please set the ''checked'' parameter below to '''true''' or '''failed''' to let others know (documentation at {{tlx|Sourcecheck}}).
{{sourcecheck|checked=false}}
Cheers.—[[User:Cyberbot II|<sup style="color:green;font-family:Courier">cyberbot II</sup>]]<small><sub style="margin-left:-14.9ex;color:green;font-family:Comic Sans MS">[[User talk:Cyberbot II|<span style="color:green">Talk to my owner</span>]]:Online</sub></small> 01:57, 2 April 2016 (UTC)
== Article should lead with samples from Joy ==
The first two code samples are from languages other than Joy, which does not seem ideal. Visiting this page for the first time and browsing for a sample of the code can give the wrong impression.
It also does seem optimal that these two samples constitute half of all the samples on the page.
[[User:Okcando|Okcando]] ([[User talk:Okcando|talk]]) 19:46, 8 October 2019 (UTC)
| |||