In a higher-order language, computation can produce not just scalar values, but also values with behavior. In other words, computations can compute computations. It’s a powerful idea, and higher-order programming languages are everywhere, but what do they look like? Here’s a classic example of a higher-order function, the derivative function, written in a [...]
on twitter
(define(life s)((λ(a s)(a(*(a(- -1 s)(* s 4))3/32)(/(-(expt 8 48)1)15)))bitwise-and(bitwise-ior(* sx1110001010001111/10000000)s)))
Turing was right, of course http://t.co/ejIdOD2V
Mad Schemer Matthias Felleisen: WANTED FOR RACKETEERING http://t.co/tvGJM61A
POPL'13: Call for proposals for co-located events http://t.co/pOAv1dff
Anyone looking for a hot shit young hacker who knows music, programming, and its intersection? (cc @ConductiveIO)
,@swannodette ... the first good reason I've heard for Stephen Wolfram being FAMOUS.
,@collapsing_star Quite competitive. It's one of the best PL groups in the world though, so that should be expected.
RT: @racketlang Racket v5.2.1 is now available: http://t.co/idX9eDTF
I'm glad I'm not applying to the PhD program at Northeastern for PL. I doubt I'd make it.
ACM SIGPLAN Haskell Symposium 2012, Call for Papers: http://t.co/sCzt9E9u
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