Tacit programming - Wikipedia
Tacit programming, also called point-free style, is a programming paradigm in which function definitions do not identify the arguments (or "points") on which they operate. Instead the definitions merely compose other functions, among which are combinators that manipulate the arguments. Tacit programming is of theoretical interest, because the strict use of composition results in programs that are
Andre's Blog
About the Project This is a small demonstration project showing how a simple byte code interpreting stack machine (virtual machine) can be built with Haskell. It is not a production VM nor of any particular practical use but is rather a simple demonstration of how a stack machine can be built. All code is available in the github repo https://github.com/andrevdm/SimpleHaskellStackVM I built this fo
FP Graph Algorithms
Manipulating graphs has traditionally been seen as a place where imperative programming reigns supreme. Tikhon Jelvis begs to differ, and shows a trick where graph traversal can be expressed by a form of pattern matching. After explaining the approach he simulates how it works on a sample graph. Summary Traditionally graph algorithms are seen as one of the things that are really hard in functional
Reddit - Dive into anything
The Haskell programming language community. Daily news and info about all things Haskell related: practical stuff, theory, types, libraries, jobs, patches, releases, events and conferences and more... So I've been reading too much papers and writing too little code. These are my first 300 lines of Haskell: http://lpaste.net/94976 Use execParse in GHCi to parse and run a program. Example> execParse
Mike Vanier: opinions
There will always be things we wish to say in our programs that in all known languages can only be said poorly. -- Alan Perlis NOTE If you're going to send me email comments about this article, please keep a few things in mind: I wrote this article a long time ago (in 2001, if memory serves), and frankly I'm not that interested in discussing it anymore. These days I'd rather write programs and tea
還暦プログラマの挑戦(Haskell に挑む)
Harrorth - Learning Haskell, Forth and Parrot - Together. 2008年6月中旬 無謀にも、Pugsの初期バージョンを読もうと意気込んだけれど、早々に無理だと断念。 インターネットをさまよい歩くも、Parsec関連は、イントロだけやって「すばらしい」で終わりが多い。部分的に字句解析に使う例も多いが、言語を作る例がほとんどない。・・・こまった。 とっ、「ysano」さんのブログに「Haskell: Forthインタプリタの実装」があって、とびついた。 でっ、出処のHarrorthにたどり着いたわけだ。 「nothingmuch」さんは、Pugsプロジェクトの方らしい。 そして、この（Harrorth）プロジェクトがスタートしたのは、「Haskellの理論を学ぶフラストレーション」が元になっているらしい。 彼
Haskell: Forthインタプリタの実装 - Accept Things
完全ではないもののForthパーサが動作するようになったので、次にForthインタプリタの実装を行ってみました。Harrothチュートリアルの説明を読みながら実装すると、それほど大きな問題もなくインタプリタが動作するようになりました。ForthのコードをASTに変換できるだけでも感動しますが、さらにインタプリタまで動作してしまうと、かなり興奮しますよw。興味のある方は是非チャレンジしてみて下さい。Audrey Tangさん、まじ凄いです。 今回はhttp://feather.perl6.nl/~nothingmuch/harrorth/doc/04.kwidのチュートリアルを読みながら実装を進めました。現段階のForthインタプリタでも、Harrothチュートリアルで説明されるような挙動が得られます。 % ./myforth 1 3 . 4 . 5 3 4 Interp {stack =
Why Concatenative Programming Matters
Introduction There doesn’t seem to be a good tutorial out there for concatenative programming, so I figured I’d write one, inspired by the classic “Why Functional Programming Matters” by John Hughes. With any luck it will get more people interested in the topic, and give me a URL to hand people when they ask what the heck I’m so excited about. Foremost, there seems to be some disagreement over wha
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Programming is “Pointless” | Microsoft Docs
GitHub - TikhonJelvis/array-forth: A simple interpreter and superoptimizer for the F18A instruction set used by GreenArrays chips.
array-forth