Parsing a functional language with Parsec | burz.io
Feval: Parsing a functional language with Parsec How to use Parsec to parse a functional programming language In the following we will discuss how to parse the grammar x ::= ( a | b | ... | z ) ( a | b | ... | z | A | B | ... | Z | 0 | 1 | ... | 9 | _ | ' )* v ::= x | True | False | 0 | 1 | -1 | 2 | -2 | ... | Function x -> e | [] | [v, v, ..., v] e ::= v | (e) | e && e | e "||" e | !e | e + e | e
F-Algebras for expression evaluation | burz.io
Feval: F-Algebras for expression evaluation Using f-algebras to produce a statically typed functional programming language A few months ago, I stumbled upon the article Understanding F-Algebras by Bartosz Milewski. After reading the article I became interested in trying to implement a functional programming language using f-algebras. The result was the statically typed functional programming langu
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
