Joy (programming language): Difference between revisions

Content deleted Content added
m caP; only unusual among FP languages surely?
Line 18:
The '''Joy programming language''' in [[computer science]] is a [[purely functional programming language]] that was produced by Manfred von Thun of [[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 not to design but to a sort of parallel evolution and convergence. It was also inspired by the [[Function-level programming|function-level programming style]] of [[John Backus]]'s [[FP (programming language)|FP]].<ref>{{cite web|title=A Conversation with Manfred von Thun|author=Manfred von Thun|url=http://www.nsl.com/papers/interview.htm|access-date=May 31, 2013|date=December 12, 2003|quote=" In the early 1980s I came across the famous Backus paper "Can programming be liberated from the von Neumann style," and I was immediately intrigued by the higher level of programming in his FP."}}</ref>
 
== How Itit Worksworks ==
 
Joy is unusual among functional programming languages (except for [[function-level programming]] languages and some esoteric ones, such as [[unlambdaUnlambda]]) 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]]):
 
<syntaxhighlight lang="C">