Concatenative Programming

5 users here now

Hello!

This space is for sharing news, experiences, announcements, questions, showcases, etc. regarding concatenative programming concepts and tools.

We'll also take any programming described as:

• pipelined
• stack-oriented
• tacit
• postfix / reverse Polish notation (RPN)

---

From Wikipedia:

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. Concatenative programming replaces function application, which is common in other programming styles, with function composition as the default way to build subroutines.

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:

x foo bar baz

---

Active Languages

Let me know if I've got any of these misplaced!

Primarily Concatenative

• Forth
• Factor
• Retro
• min
• Joy
• Uiua
• kcats
• iNet
• mlatu
• Execline

Concatenative-ish, Chain-y, Pipe-y, Uniform Function Call Syntax, etc.

• Nim
• Roc
• Unix Pipes
• Cognate
• D Programming Language
• Koka

---

Cheat Sheets & Tutorials

• Learn Factor in Y minutes
• A panoramic tour of Factor
• Factor Tutorial Video

Discord

• Concatenative
• Factor

IRC

• #concatenative on irc.libera.chat

Wikis

• concatenative wiki

Wikipedia Topics

• Reverse Polish Notation
• Uniform Function Call Syntax
• Stack-Oriented Programming
• Tacit Programming

Subreddits

• r/concatenative
• r/factor

GitHub Topics

• Stack-Based Language
• Concatenative
• Concatenative Language
• Concatenative Programming Language
• Concatenative Interpreting Language

Blogs

• planet-factor

Practice

• Codewars (Forth, Factor, Nim)
• Advent of Code
• Code Golf (Forth, Factor, Nim)
• Project Euler
• Exercism (Nim)
• Perl Weekly Challenge

MODERATORS

USING: combinators kernel sequences sets unicode ;

MEMO: char>score ( char -- n )
  {
    { [ dup "AEIOULNRST" in? ] [  1 ] }
    { [ dup         "DG" in? ] [  2 ] }
    { [ dup       "BCMP" in? ] [  3 ] }
    { [ dup      "FHVWY" in? ] [  4 ] }
    { [ dup          "K" in? ] [  5 ] }
    { [ dup         "JX" in? ] [  8 ] }
    { [ dup         "QZ" in? ] [ 10 ] }
  } cond nip ;

: scrabble-score ( str -- n )
  >upper [ char>score ] map-sum ;

USING: assocs.extras kernel make sequences unicode ;

: scrabble-score ( str -- n )
  >upper
  [
    "AEIOULNRST" [  1 swap ,, ] each
            "DG" [  2 swap ,, ] each
          "BCMP" [  3 swap ,, ] each
         "FHVWY" [  4 swap ,, ] each
             "K" [  5 swap ,, ] each
            "JX" [  8 swap ,, ] each
            "QZ" [ 10 swap ,, ] each
  ] H{ } make
  swap values-of sum ;

USING: assocs.extras kernel literals make sequences unicode ;

CONSTANT: charscores $[
  [
    "AEIOULNRST" [  1 swap ,, ] each
            "DG" [  2 swap ,, ] each
          "BCMP" [  3 swap ,, ] each
         "FHVWY" [  4 swap ,, ] each
             "K" [  5 swap ,, ] each
            "JX" [  8 swap ,, ] each
            "QZ" [ 10 swap ,, ] each
  ] H{ } make
]

: scrabble-score ( str -- n )
  charscores swap >upper values-of sum ;

USING: assocs.extras kernel literals make sequences unicode ;

CONSTANT: charscores $[
  [
    { 1 2 3 4 5 8 10 }
    { "AEIOULNRST" "DG" "BCMP" "FHVWY" "K" "JX" "QZ" }
    [ [ ,, ] with each ] 2each
  ] H{ } make
]

: scrabble-score ( str -- n )
  charscores swap >upper values-of sum ;