Joy (programming language): Difference between revisions

Revision as of 18:56, 3 December 2022

Revision as of 16:46, 12 December 2022

Line 14:

|dialects =

|influenced_by = [[Scheme (programming language)|Scheme]], [[FP (programming language)|FP]], [[Forth (programming language)|Forth]]

|influenced = [[Factor (programming language)|Factor]], [[Cat (programming language)|Cat]], V, [[Trith (programming language)|Trith]]

}}

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 aan sort of parallelindependent 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 it works ==