Type Theory

by @nandi.uk

Posts about type theory, dependent types, proof assistants, and programming language theory — Lean, Agda, Idris, Coq, Haskell, category theory, and related research.

Pull to refresh
raganwald.com @raganwald.functional.cafe.ap.brid.gy · 2d
0

Hand-written tests for porting boolean operators from the Lambda Calculus and/or Smullyan Forest to Concatenative Combinators. Yet another reminder to... “Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy.”—Dr. Alan J. Perlis, 1982