-
On comp.lang.forth you [hypothesized](https://comp.lang.forth.narkive.com/U38oqt1m/graph-theory-representation-for-forth-stack-machine-features-constructs#post7): "All mathematical and programming str…
-
It would be nice to have some content on the wiki
-
Weekend:
* read up on some more PL theory on concatenative and tacit programming languages
* read up on some Coq tutorials for specifying and proving properties about stack machine languages
* more…
-
Not sure how doable this would be, but it'd be nice to have some way of converting a `fend` script to `bc` or `dc` syntax (chiefly for embedding within a portable shell-script designed to run on syste…
-
-
Introduced through #67
Problem: implementing words without subwords is difficult
Technically speaking, loaded words can define their own
words but they will leak into the remainder of the prog…
-
I'm reading your personal web site and seeing all your endeavours with languages and I like your attitude you expressed e.g. in [Why didn't you use an existing game engine?](https://github.com/zestere…
-
Let `foo: a b -> x`, `bar: c d e -> y`. Then `foo ; bar` is the function of type `a b c d e -> x y`, such as `x = a b foo`, `y = c d e bar`.
Infix notation ``foo `F` bar`` can be defined as `(foo ;…
-
收集这些术语的目的是为了更好的使计算机基础薄弱的同学更好的了解计算机基础知识,并且能够在github和stackoverflow等平台和各国程序员谈笑风生。
-
Especially given we're already on Travis, I don't think it'd be too hard to build Docker images as part of our release cycle. That'd be very handy in server contexts, even if it wouldn't be too useful…