A key observation made by Mairson and explained in his 2004 JFP Functional Pearl about the type inference problem for simply typed λ-terms is that, when the term is linear (every bound variable occurs exactly once), the most general type and normal form are isomorphic. So given a linear term in normal form, we can [...]
on twitter
"This is not a law-and-order issue; it is a medical and a human rights issue." http://t.co/nRKzmDxC
Commercial Users of Functional Programming (CUFP) 2012, Call for Presentations http://t.co/hrN4WyvB
@TheOfficialACM Perlis.
@swannodette @samth No, but it's prototyped as a lang language on github. Still very experimental.
Summer School on Language Frameworks (in the Carpathian Mountains!) http://t.co/WbrJWu5N
Racket + Generics via @asumu: https://t.co/OFAVlDuA
5-year Postdoc in Higher-Order Model Checking at University of Tokyo with Naoki Kobayashi http://t.co/xlyl361X
@rbxbx Not true! TFP'10 was and TFP'13 will be. See http://t.co/vwiW0aun
Draft program for Trends in Functional Programming 2012 http://t.co/k1TOw0J6
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