Brainfuck 実装で学ぶ TypeScript 型レベルプログラミング - Object.create(null)
およそ 4 年前に「TypeScript で型レベル Brainfuck」という記事を書きました. susisu.hatenablog.com それから 4 年間の間に TypeScript も進化し, 型レベルプログラミングの技法にも大きな変化がありました. 特に顕著な影響があったものでは, TypeScript 4.0 のタプル型の改善 TypeScript 4.1 のテンプレートリテラル型や条件型での再帰 TypeScript 4.5 の条件型での末尾再帰の除去と, 再帰の上限の緩和 などがあります. こういった変化も踏まえた上で, いまから TypeScript の型レベルプログラミングに入門する人に向けて改めてまとめ直したものがこの記事です. 内容は記事執筆時点の最新版である TypeScript 5.4.5 で動作を確認しています. ぜひ Playground などを使って,
F*dging up a Racket
Danny Yoo <dyoo@hashcollision.org> Source code can be found at: https://github.com/dyoo/brainfudge. The latest version of this document lives in http://hashcollision.org/brainfudge. 1 IntroductionIf people say that Racket is just a Scheme, they are short-selling Racket a little. It’s more accurate to say that Racket is a language laboratory, with support for many different languages. Is that reall
An Optimising BF Compiler
Almost everyone’s written a BF implementation these days. In fact, BF is now so widespread that LLVM and libjit both include tutorials for a basic implementation! However, what would an industrial strength compiler look like? I set out to write a highly optimising BF compiler using Rust and LLVM. bfc was the result, and it includes a whole range of optimisations. I believe some are completely nove
Interpreter Compiler JIT
Interpreters and compilers are interesting programs, themselves used to run or translate other programs, respectively. Those other programs that might be interpreted might be languages like JavaScript, Ruby, Python, PHP, and Perl. The other programs that might be compiled are C, C++, and to some extent Java and C#. Taking the time to do translation to native machine code ahead of time can result i
brainfuck optimization strategies | matslina
Mats Linander 2015-01-07 - New York In almost every computation a great variety of arrangements for the succession of the processes is possible, and various considerations must influence the selection amongst them for the purposes of a Calculating Engine. One essential object is to choose that arrangement which shall tend to reduce to a minimum the time necessary for completing the calculation.” A
実用Brainf*ckプログラミング入門編
Learning Phrase Representations using RNN Encoder-Decoder for Statistical Mac...Yuta Kikuchi
Brainfuck Visualizer
+++++ +++++ initialize counter (cell #0) to 10 [ use loop to set 70/100/30/10 > +++++ ++ add 7 to cell #1 > +++++ +++++ add 10 to cell #2 > +++ add 3 to cell #3 > + add 1 to cell #4 <<<< - decrement counter (cell #0) ] > ++ . print 'H' > + . print 'e' +++++ ++ . print 'l' . print 'l' +++ . print 'o' > ++ . print ' ' << +++++ +++++ +++++ . print 'W' > . print 'o' +++ . print 'r' ----- - . print 'l'
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
GitHub - thaliaarchi/bfcoq: Brainfuck compiler in Coq
GitHub - Forensor/brainhask: Brainf**k interpreter in Haskell
Writing A Brain** Compiler
GitHub - Gandalf-/BrainBash: A heavily optimizing Brain**** interpreter written in Bash!
https://kiwec.net/blog/posts/beating-c-with-brainfuck/
Hillel's Brainfuck Interpreter, explained
GitHub - dmitmel/brainwhat: A fast optimizing Brainfuck interpreter written in pure Rust
How Zig Do?
control flow in brainfuck | matslina
Reddit - Dive into anything
GitHub - huonw/brainfuck_macros: A brainfuck procedural macro for Rust
https://github.com/quchen/articles/blob/master/write_yourself_a_brainfuck.md
Malone Dot CC · LHBS #1: Intro