Joy (Programming Language)

栏目: IT技术 · 发布时间: 4年前

内容简介:TheJoy is unusual (except forThe variable x is a formal parameter which is replaced by the actual value to be squared when the function is called. In afunctional language (Scheme) the same function could be defined:
Joy
Paradigm multi-paradigm : functional , concatenative , stack-oriented
Designed by Manfred von Thun
Developer Manfred von Thun
John Cowan
First appeared 2001
Stable release

March 17, 2003 / March 17, 2003

Typing discipline strong , dynamic
Majorimplementations
Joy0, Joy1, "Current Joy", "John Cowan's Joy", "JoyJ (Joy in jvmm)"
Influenced by
Scheme , FP , Forth
Influenced
Factor ,Cat, V,Trith

The Joy programming language incomputer science is a purely functional programming language that was produced by Manfred von Thun ofLa Trobe University inMelbourne,Australia. Joy is based on composition of functions rather thanlambda calculus. It has turned out to have many similarities toForth, due not to design but to a sort of parallel evolution and convergence. It was also inspired by the function-level programming style ofJohn Backus'sFP.

Contents

How it works [ edit ]

Joy is unusual (except for function-level programming languages and some esoteric ones, such asunlambda) in its lack of alambda operator, and therefore lack offormal parameters. To illustrate this with a common example, here is how the square function might be defined in an imperative programming language (C):

int square(int x)
{
    return x * x;
}

The variable x is a formal parameter which is replaced by the actual value to be squared when the function is called. In afunctional language (Scheme) the same function could be defined:

(define square
  (lambda (x) 
    (* x x)))

This is different in many ways, but it still uses the formal parameter x in the same way. In Joy the square function is defined:

DEFINE square == dup * .

In Joy, everything is a function that takes astack as an argument and returns a stack as a result. For instance, the numeral '5' does not represent an integer constant, but instead a short program that pushes the number 5 onto the stack.

  • The dup operator simply duplicates the top element of the stack by pushing a copy of it.
  • The * operator pops two numbers off the stack and pushes their product.

So the square function makes a copy of the top element, and then multiplies the two top elements of the stack, leaving the square of the original top element at the top of the stack, with no need for a formal parameter. This makes Joy concise, as illustrated by this definition ofquicksort:

DEFINE qsort ==
   [small]
   []
   [uncons [>] split]
   [enconcat]
   binrec.

"binrec" is one of Joy's manyrecursive combinators, implementing binary recursion. It expects four quoted programs on top of the stack which represent:

  • the termination condition (if a list is "small" (1 or 0 elements) it is already sorted),
  • what to do if the termination condition is met (in this case nothing),
  • what to do by default (split the list into two halves by comparing each element with the pivot), and finally
  • what to do at the end (insert the pivot between the two sorted halves).

Mathematical purity [ edit ]

In Joy, themeaning function is ahomomorphism from thesyntactic monoid onto thesemantic monoid. That is, the syntactic relation ofconcatenation ofsymbols maps directly onto the semantic relation ofcomposition offunctions. It is ahomomorphism rather than anisomorphism, because it isonto but notone-to-one; that is, no symbol has more than one meaning, but some sequences of symbols have the same meaning (e.g. "dup +" and "2 *").

Joy is a concatenative programming language : "The concatenation of two programs denotes the composition of the functions denoted by the two programs".

Its library routines mirror those of ISOC, though the current implementation is not easily extensible with functions written in C.

See also [ edit ]


以上就是本文的全部内容,希望本文的内容对大家的学习或者工作能带来一定的帮助,也希望大家多多支持 码农网

查看所有标签

猜你喜欢:

本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们

Microsoft Windows程序设计

Microsoft Windows程序设计

佩措尔德 / 章立民 / 华中科技 / 2004-1 / 118.00元

Charles Petzold是全球最权威且知名的Windows程序设计专家,他将其最畅销Programming Microsoft Windows with C#一书加以改写,使之能完全适用于Visual Basic.NET的开发人员。这位畅销书的作家示范了如何使用Visual Basic.NET将Windows Forms的功能发挥到极致(Windows Forms是新一代的Windows程序......一起来看看 《Microsoft Windows程序设计》 这本书的介绍吧!

HTML 压缩/解压工具
HTML 压缩/解压工具

在线压缩/解压 HTML 代码

UNIX 时间戳转换
UNIX 时间戳转换

UNIX 时间戳转换

HEX HSV 转换工具
HEX HSV 转换工具

HEX HSV 互换工具