IO monad in 1965
Introduction The first monad tutorial and the `programmable semicolon' Landin's IO monad in modern eyes Other Landin's discoveries References Introduction Monads turned out a convenient tool to represent and reason about computational effects -- such as IO, mutable state and exceptions -- in lambda calculi. In particular, monads let us clearly separate evaluation-order--insensitive simplifications
Lambda Calculus and Lambda Calculators
Beyond Church encoding: Boehm-Berarducci isomorphism of algebraic data types and polymorphic lambda-terms lambda to SKI: the first compositional translation Simplest poly-variadic fix-point combinators for mutual recursion Fix-point combinators are infinitely many and recursively-enumerable Many More Predecessors: A Representation Workout `switch' in lambda calculus Pairs, sums, etc. in System T/P
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
The HEVEA Home page
