January 2012
4 posts
1 tag
Jan 25th
3 notes
3 tags
How many lines of Java would it take...
… to do this? obj.class.superclass.public_instance_methods(false).sort
Jan 12th
16 notes
“I am so clever that sometimes I don’t understand a single word of what I...”
–  Oscar Wilde
Jan 12th
1 tag
The Most Entertaining Philosopher (James) →
…for a philosopher he was remarkably insistent on the questionable nature of so many of the concepts that European philosophy since Socrates had taken as fundamental and enduring.
Jan 12th
7 notes
December 2011
1 post
5 tags
Dec 14th
13 notes
October 2011
1 post
Oct 26th
September 2011
1 post
3 tags
WatchWatch
Sep 2nd
18 notes
August 2011
1 post
2 tags
Aug 8th
2 notes
July 2011
1 post
4 tags
“Scalaz is documented in parts because these parts can exist independently of...”
– tony morris (creator of scalaz)
Jul 7th
4 notes
February 2011
4 posts
3 tags
Tom Van Vleck →
Feb 15th
5 tags
It's Bertrand Meyer Study Day →
Feb 14th
54 notes
2 tags
“Aspect weavers work by generating a join point representation of the com- ponent...”
–  Aspect-Oriented Programming by Gregor Kiczales, John Lamping, Anurag Mendhekar, Chris Maeda, Cristina Videira Lopes, Jean-Marc Loingtier, and John Irwin
Feb 11th
2 tags
“Actually, Genera has real limitations. Dependent on microcode support for...”
– http://www.reddit.com/r/lisp/comments/fh99v/would_it_be_possible_write_an_entire_os_in_lisp/c1fyq18
Feb 8th
January 2011
6 posts
3 tags
“In most cases the only important properties of a degree are to prove beyond...”
–  Eric Naggum (at http://www.xach.com/naggum/articles/3250532115226900@naggum.no.html)
Jan 18th
4 tags
“One of the major characteristics of Lisp is that Lisp programs are Lisp data and...”
– John McCarthy in comp.emacs (http://groups.google.com/group/comp.emacs/msg/c9442db9331835e4?dmode=source)
Jan 12th
2 tags
“That was one of the things that really surprised me about the real world: that...”
–  nostrademons at HN (http://news.ycombinator.com/item?id=2095406)
Jan 12th
Big lessons for the weekend
George Orwell’s Politics and the English Language MJD of “Higher Order Perl” on Lisp macros Richard Feynman and The Connection Machine They Write the Right Stuff
Jan 7th
2 tags
“Logic variables and accompanying unification are such salient features of...”
– Oleg at http://okmij.org/ftp/kakuritu/logic-programming.html#logic-var
Jan 6th
"Why Conniving is Better than Planning" by Gerald... →
Jan 4th
December 2010
1 post
2 tags
“All organizational functions carried out by classes can be accomplished in a...”
– “Organizing Programs without Classes” (PDF)
Dec 20th
August 2010
1 post
4 tags
“Well, on a Symbolics lisp machine, which I used for a couple years you could hit...”
– Tim Daly at http://article.gmane.org/gmane.comp.java.clojure.user/34272
Aug 6th
July 2010
3 posts
A man, a plan, a canoe, pasta, heros, rajahs, a coloratura, maps, snipe, percale, macaroni, a gag, a banana bag, a tan, a tag, a banana bag again (or a camel), a crepe, pins, Spam, a rut, a Rolo, cash, a jar, sore hats, a peon, a canal—Panama!
Jul 30th
2 tags
Jul 7th
1 tag
MEAP
There are advantages and disadvantages to Manning’s early access program (MEAP). On the one hand people see all of the dumb things you say along the way and on the other hand people see all of the dumb things you say along the way. (RE: The Joy of Clojure)
Jul 7th
February 2010
0 posts
1 tag
Denotational Versus Declarative Semantics For... →
Denotational semantics is the usual mathematical semantics for functional programming languages. It is higher order (H.O.) in the sense that the semantic domain D includes [D ! D] as a subdomain. On the other hand, the usual declarative semantics for logic programs is first order (F.O.) and given by the least Herbrand model. In this paper, we take a restricted kind of H.O. conditional...
Feb 1st
July 2009
2 posts
3 tags
Jul 30th
After listening to Wagner today, I really wanted to go and smack someone with a white glove.
Jul 30th
June 2009
3 posts
3 tags
Prototypal Inheritance in Javascript →
Jun 1st
1 tag
“Warming up the computer would also be a side effect.”
– Unknown source
Jun 1st
1 tag
“If your programming language were purely functional, the only thing you could do...”
– Rich Hickey
Jun 1st
May 2009
3 posts
1 tag
“I am also convinced that it’s not just an academic exercise to ensure that...”
– Pascal Costanza
May 6th
1 tag
Scala Destructuring Bind
val (x,y) = (10, “ten”) case class T(one:Int, two:String) val t = T(6,"six" val T(i,j) = t val T(a,b) = T(10,"book") val T(a,_) = T(10,"book") // ignores the bind of "book" object Names { def unapply(s:String): Option[String] = { if( s.trim.startsWith("Mr")) Some(s.trim.drop(2)) else None } } val Names(name) = "Mr Jones" // gives "Jones"
May 5th
,_-=(!7(7/zs_. .=' ' .`/,/!(=)Zm. .._,,._.. ,-`- `,\ ` -` -`\\7//WW. ,v=~/.-,-\- -!|V-s.)iT-|s|\-.' `///mK%. v!`i!-.e]-g`bT/i(/[=.Z/m)K(YNYi.. /-]i44M. v`/,`|v]-DvLcfZ/eV/iDLN\D/ZK@%8W[Z.. `/d!Z8m ...
May 5th
April 2009
9 posts
4 tags
WatchWatch
The Scala Experiment, a presentation by Martin Odersky.
Apr 20th
3 tags
Apr 20th
“Advocating Object-Oriented Programming is like advocating Pants-Oriented...”
– Jacob Gabrielson
Apr 17th
“Hiding the manipulation of representation is not the same thing as making...”
– James Iry
Apr 17th
“In Erlang the concurrency model is (always) a distributed one and in Clojure it...”
– Rich Hickey
Apr 16th
Free Variables
Jimmy-Jimmy-Jim-Jim: What is a free variable?
Quux: Variables referred in a function that are *not* local or passed in as arguments
Apr 16th
Something to follow-up on: Smalltalk’s standard control structures, including branches (if/then/else) and loops (while and for), are defined using objects whose methods accept closures.
Apr 16th
2 tags
“If you post an advert for a Haskell developer you will get 20 applicants. All...”
– Paul Johnson @ http://www.haskell.org/pipermail/haskell-cafe/2009-January/054072.html
Apr 15th
Scala Trait Fun
I forget where I found this #Scala snippet: trait RichIterableOps[A] { // required method def iterator: Iterator[A] def foreach(f: A => Unit) = { val iter = iterator while (iter.hasNext) f(iter.next) } def foldLeft[B](seed: B)(f: (B, A) => B) = { var result = seed foreach(e => result = f(result, e)) result } } val richSet = new HashSet[Int] with...
Apr 15th
March 2007
1 post
Mar 23rd