Type systems and logic
Alyssa Carter An important result in computer science and type theory is that a type system corresponds to a particular logic system. How does this work? The basic idea is that of the Curry-Howard Correspondence. A type is interpreted as a proposition, and a value is interpreted as a proof of the proposition corresponding to its type. Most standard logical connectives can be derived from this idea
Option and null in dynamic languages
Michael Arntzenius Many dynamic languages have a value denoting “absence”: None in Python, undefined in JavaScript, and nil in Lisp, Clojure, Ruby, and Lua. We can compare this to the null value of reference types in languages like C, Java, or Go. Or, we can compare it to the None value of option types in languages like ML, Haskell, Rust, or Swift. But these two comparisons have very different pro
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Why are objects so hard to debug?
