> This web page is a revised and extended version of Appendix A from the book Conceptual Structures by John F. Sowa. It presents a brief summary of the following topics for students and general readers of that book and related books such as Knowledge Representation and books on logic, linguistics, and computer science.

The Archive of Interesting Code is an (ambitious) effort on my part to research, intuit, and code up every interesting algorithm and data structure ever invented. In doing so, I hope both to learn the mathematical techniques that power these technologies and to improve my skills as a programmer.

RT @dsyme: Fantastic article: Railway oriented programming | F# for fun and profit #fsharp

RT @carinmeier: -> This book on computation and programming language design looks great #ruby

Danish philosopher Søren Kierkegaard—often considered the first existentialist—was born 200 years ago this past Sunday in Copenhagen. Writing under pseudonyms like Johannes Climacus and Johannes de Silentio, Kierkegaard attacked both the idealism of contemporary philosophers Hegel and Schelling and the bourgeois complacency of European Christendom. A highly skilled rhetorician, Kierkegaard preferred the indirect approach, deploying irony, ridicule, parody and satire in a paradoxical search for individual authenticity within a European culture he saw as beset by self-important puffery and unthinking mass movements.

One of my favorite C.S. books is available on PaperbackSwap... worth checking out IMO

> Pixie is a new operating system for sensor networks that enables resource-aware programming, a model in which applications receive feedback on, and have explicit control over, resource usage. Pixie is designed to support the needs of data-intensive applications. These applications, which include high-resolution monitoring of acoustic, seismic, acceleration, and other signals, involve high data rates and extensive in-network processing. Given the fundamentally resource-limited nature of sensor networks, a pressing concern for such applications is their ability to receive feedback on, and adapt their behavior to, fluctuations in both resource availability and load.

RT @clojure_conj: There's still time to submit a proposal for #Clojure/conj 2013 in DC! Deadline is June 7.

The wringing of hands and gnashing of teeth at the demise of Hacker News -->

RT @emerginglangs: Get ready to register for this year’s event:

> Lock-free programming is a way of writing thread-safe code such that in the case of contention, the system is guaranteed to advance as a whole. "Wait-free" programming takes this a step further: the code is set up such that each thread can always advance regardless of what the other is doing. This also has the benefit of avoiding expensive locks.

RT @littlecalculist: .@swannodette Filed here: — please feel free to add additional benchmarks you think are interesting/valuable.

A peak of the back cover for Functional JavaScript --> more info at

A peak of the back cover for Functional JavaScript --> more info at

While preparing for a conference talk on Garbage Collection algorithms, implementations, and history, I have made a habit of scouring the internet for information on how to communicate the challenging ideas that Garbage Collection (GC) encompasses.

RT @carinmeier: Who knew that @fogus is a rockstar brogrammer?

I love me some Wikipedia, but C2 still takes the cake.

Oh no... I've been drawn into reading about Bitcoin and Cypherpunks. :-O #sendhelp

Oh no... I've been drawn into reading about Bitcoin and Cypherpunks. :-O #sendhelp

This is a tiny C compiler, I wrote it in a very restricted dialect of OCaml. It is in the same family as otcc but will work for the x86_64 architecture. My medium term goal is to port it into the C dialect it compiles, so I can bootstrap the thing. It will generate dynamically linked ELF files for the 64bits architecture x86_64 (AMD64 or IA-32e). It has no intermediate language and generates code as it parses the C source file. This makes it very fast, unsafe and unoptimizing. Code generated sucks, no doubt, but the compiler is very short and understandable.

@jasongilman This is as close as I have ATM

Whoa! @antiheroine's giving a @strangeloop_stl keynote!? So cool.

> When I was playing Racket Roguelike earlier this week1, I realized something: I can see everything. There are no surprises, no mystery, no darkness
>
> Let’s fix that.

My recollections of operating system design via @prismatic

Mark I FORTH computer -->

Current status: Friebyrd.

This tour is to help those new to Datomic understand Datomic's built-in datalog by providing a simple domain and schema, and by walking through some use cases.  For a more complete treatment of Datomic's query capabilities, please take a look at the documentation.

Go: The game to beat all games via @prismatic

> In any language that supports recursive functions (ie. pretty much everything except Fortran 77 and Brainf*ck) the language runtime keeps a stack of what functions are currently executing. Stack unwinding is a way of inspecting, and possibly modifying, that stack.

RT @OReillyMedia: #Video Deal/Week: Clojure Inside Out - $34.99 (Save 50%)

Use code VDWK

Orgiastic Go imports meet non-dev causing mass confusion. HN cavalierly shouts coulda-woulda-shoulda ☠