The Theory of Concatenative Combinators
Brent Kerby (bkerby at byu dot net). Completed June 19, 2002. Updated February 5, 2007. Introduction A Few Combinators: swap, dup, zap, unit, cat, cons, i, dip Lambdas An Abstraction Algorithm The sip Combinator Schemes of Combinators: dign, buryn Another Combinator Scheme: flipn Two More Schemes: dipn, sipn Applicative Combinators: w, k, b, c, s Towards a Minimal Base: {cons, sip, k} A Smaller Ba
GitHub - cdiggins/cat-language: Cat - a statically typed functional stack-based programming language
Joy: Forth's Functional Cousin
Presented at the 17-th EuroForth Conference (23-26 November 2001, Schloss Dagstuhl, Saarbruecken, Germany) by Reuben Thomas, on my behalf and with my thanks. Synopsis of the language Joy The language Joy is a purely functional programming language. Whereas all other functional programming languages are based on the application of functions to arguments, Joy is based on the composition of functions
HugeDomains.com
Captcha security check cdiggins.com is for sale Please prove you're not a robot View Price Processing
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Cat Interpreter in JavaScript with Turtle Graphics | Lambda the Ultimate