To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

How to transfigure the Wikipedia

Would you like Wikipedia to always look as professional and up-to-date? We have created a browser extension. It will enhance any encyclopedic page you visit with the magic of the WIKI 2 technology.

Try it — you can delete it anytime.

Install in 5 seconds
4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
Great Wikipedia has got greater.
.
Leo
Newton
Brights
Milds

Concatenative programming language

From Wikipedia, the free encyclopedia

A concatenative programming language is a point-free computer programming language in which all expressions denote functions, and the juxtaposition of expressions denotes function composition.[1] Concatenative programming replaces function application, which is common in other programming styles, with function composition as the default way to build subroutines.

YouTube Encyclopedic

  • 1/5
    Views:
    5 348
    2 197
    562
    894
    1 207
  • Stanford Seminar - Concatenative Programming: From Ivory to Metal
  • Concatenative Programming - Lesson 1
  • Demo — Ait: A Concatenative Language for Creative Programming
  • Church Encoding in Concatenative Programming Languages (Teodor Ande Elstad)
  • Stian Veum Møllersen Revisting Concatenative Languages with Creative Programming - Code Mesh 2017

Transcription

Example

For example, a sequence of operations in an applicative language like the following: 

y = foo(x)
z = bar(y)
w = baz(z)

...is written in a concatenative language as a sequence of functions:[2] 

x foo bar baz

Functions and procedures written in concatenative style are not value level, i.e. they typically do not represent the data structures they operate on with explicit names or identifiers. Instead they are function level – a function is defined as a pipeline, or a sequence of operations that take parameters from an implicit data structure upon which all functions operate, and return the function results to that shared structure so that it will be used by the next operator.[3]

The combination of compositional semantics with a syntax that mirrors such a semantic makes concatenative languages highly amenable to algebraic manipulation of programs;[4] although it may be difficult to write mathematical expressions directly in them.[5] Concatenative languages can be implemented efficiently with a stack machine, and are commonly present implicitly in virtual machines in the form of their instruction sets.[5]

Properties

The properties of concatenative languages are the result of their compositional syntax and semantics:

  • The reduction of any expression is the simplification of one function to another function; it is never necessary to deal with the application of functions to objects.[6]
  • Any subexpression can be replaced with a name that represents the same subexpression. This is referred to in the concatenative community as factoring and is used extensively to simplify programs into smaller parts.
  • The syntax and semantics of concatenative languages form the algebraic structure of a monoid.[7]
  • Concatenative languages can be made well-suited to an implementation inspired by linear logic where no garbage is ever generated.[8]

Implementations

The first concatenative programming language was Forth, although Joy was the first language to call itself concatenative. Other concatenative languages are dc, Factor, Onyx, PostScript, and RPL.

Most existing concatenative languages are stack-based; this is not a requirement and other models have been proposed.[9][10][11] Concatenative languages are currently used for embedded, desktop, and web programming, as target languages, and for research purposes.

Most concatenative languages are dynamically typed. Exceptions include the statically typed Cat language.[12]

See also

References

  1. ^ "Christopher Diggins: What is a concatenative language". Drdobbs.com. 2008-12-31. Retrieved 2013-07-01.
  2. ^ "Name code not values". Concatenative.org. Retrieved 13 September 2013.
  3. ^ "Concatenative language". Concatenative.org. Retrieved 13 September 2013.
  4. ^ "Rationale for Joy, a functional language". Archived from the original on 2011-01-15.
  5. ^ a b "Why Concatenative Programming Matters". Retrieved 13 September 2013.
  6. ^ "von Thun, Manfred: Joy compared with other functional languages". Archived from the original on 2011-10-06.
  7. ^ "von Thun, Manfred: Mathematical foundations of Joy". Archived from the original on 2010-07-31.
  8. ^ "Henry Baker: Linear Logic and Permutation Stacks — The Forth Shall Be First". Home.pipeline.com. Archived from the original on 2014-07-24. Retrieved 2013-07-01.
  9. ^ "The Concatenative Language XY". Nsl.com. Retrieved 2013-07-01.
  10. ^ "The Enchilada Programming Language". Enchiladacode.nl. Retrieved 2013-07-01.
  11. ^ "The Om Programming Language". Om-language.org. Retrieved 2013-07-01.
  12. ^ "Cat Specification". Cat-language.com. Archived from the original on 2015-02-05. Retrieved 2013-07-01.

External links

This page was last edited on 1 February 2024, at 22:17
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.
Contact WIKI 2
Introduction
Terms of Service
Privacy Policy