# Ann: The Unimperative Programming Language

## Christopher Diggins — 2006-02-13 23:47:56

    I wanted to announce that I am developing a new open-source concatenative

    programming language called Unimperative. It is still in its early stages,

    but if you are interested in helping out come visit

    http://www.unimperative.com and join the mailing list.

    Unimperative is inspired by Joy, but with some not so insignificant

    differences:

    - Unimperative is legal C++, and can be compiled as C++ code.

    - Unimperative support both right-concatenation ( >> ) and

    left-concatenation ( << )

    - Unimperative supports namespaces

    - Unimperative supports stack type-checking

    Any comments and help would be most welcome!

    By the way Manfred, I just wanted to give my kudos for developing Joy. It is

    an excellent language, thank you for developing it!

    --

    Christopher Diggins

    http://www.cdiggins.com

    [Non-text portions of this message have been removed]

## William Tanksley, Jr — 2006-02-14 03:00:38

    Christopher Diggins <cdiggins@...> wrote:

     > I wanted to announce that I am developing a new open-source concatenative

    > programming language called Unimperative. It is still in its early stages,

    > but if you are interested in helping out come visit

    > http://www.unimperative.com and join the mailing list.

     Very interesting. Good luck!

    Interestingly, some mathematicians use concatenative RPN to denote

    function composition. The opening chapters of their books are similar

    to the part of your webpage where you explain >> and <<. (I'm thinking

    specifically of "Topics in Algebra" by Herstein.)

    Oh, I'm not at ALL familiar with turing-completeness in templates, but

    I do know that they are. Given that, you may find it useful to use the

    algorithms discussed for polymorphic static typechecking on a stack at

    http://home.vrweb.de/stephan.becher/forth/ (yes, thankfully,

    strongForth is back! And stronger than ever.).

     > Christopher Diggins

     -Billy

## Christopher Diggins — 2006-02-14 15:11:39

    Thanks for the encouragement and the strongforth link.

     On 2/13/06, William Tanksley, Jr <wtanksleyjr@...> wrote:

    >

    > Christopher Diggins <cdiggins@...> wrote:

    > > I wanted to announce that I am developing a new open-source

    > concatenative

    > > programming language called Unimperative. It is still in its early

    > stages,

    > > but if you are interested in helping out come visit

    > > http://www.unimperative.com and join the mailing list.

    >

    > Very interesting. Good luck!

    >

    > Interestingly, some mathematicians use concatenative RPN to denote

    > function composition. The opening chapters of their books are similar

    > to the part of your webpage where you explain >> and <<. (I'm thinking

    > specifically of "Topics in Algebra" by Herstein.)

    >

    > Oh, I'm not at ALL familiar with turing-completeness in templates, but

    > I do know that they are. Given that, you may find it useful to use the

    > algorithms discussed for polymorphic static typechecking on a stack at

    > http://home.vrweb.de/stephan.becher/forth/ (yes, thankfully,

    > strongForth is back! And stronger than ever.).

    >

    [Non-text portions of this message have been removed]