The current issue of CACM has an article on type theory:
When the philosopher Bertrand Russell invented type theory at the beginning of the 20th century, he could hardly have imagined that his solution to a simple logic paradox—defining the set of all sets not in themselves—would one day shape the trajectory of 21st century computer [...]
-
‹ Home
Contents
-
Categories
-
Archives
Blogroll
- A Neighborhood of Infinity
- Aaron Hawley (Refusal Computing)
- Aaron Stump (QA9)
- Andrej Bauer (Mathematics and Computation)
- Close Encounters of the Logical Kind (Riccardo Pucella)
- Computing Community Consortium (CCC Blog)
- Computing Research Policy Blog
- Dave Herman (The Little Calculist)
- Jacob Matthews
- Jens Axel Søgaard (Everything Scheme)
- Jereme Mongeon (test2)
- Justin Henry (Green Galoshes)
- Lambda the Ultimate
- Lance Fortnow and Bill Gasarch (Computational Complexity)
- Matt Might (Professor Might’s Blog)
- Mike Machenry (Turing Complete Waste of Time)
- Phil Wadler
- Phillip Alvelda (All the Best Bits)
- PLT Scheme
- Untyped
- Wand Symposium and Festschrift
-
RSS Feeds
-
Meta