Unification-free ("keyword") type checking
From my perspective, one of the biggest open problems in implementing programming languages is how to add a type system to the language without significantly complicating the implementation. For example, in my tutorial Fall-from-Grace implementation the type checker logic accounts for over half of the code. In the following lines of code report I’ve highlighted the modules responsible for type-che
fay
fay: A compiler for Fay, a Haskell subset that compiles to JavaScript. Fay is a proper subset of Haskell which is type-checked with GHC, and compiled to JavaScript. It is lazy, pure, has a Fay monad, an FFI, tail-recursion optimization (experimental), and support for cabal packages. Documentation See https://github.com/faylang/fay/wiki Examples See the examples directory and https://github.com/fay
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Unification-free ("keyword") type checking | Lobsters
Home · faylang/fay Wiki · GitHub
GitHub - faylang/fay: A proper subset of Haskell that compiles to JavaScript
Fay -- A proper subset of Haskell that compiles to Javascript | Hacker News