Written by Eric Normand. Published: November 22, 2013
Sign up for weekly Clojure tips, software design, and a Clojure coding challenge.
conj recap, deep walking, and schemas
Issue 1.60 November 22, 2013
Greetings, Persistent Data Structures,
Friends, the Conj is over. There's no more cake. No more tweets. Now, we wait for the videos.
But, before that, there's always the recaps! I wasn't there, but I was informed that a major theme of the conference was schemas for data. So I've included a couple of libraries that play on that theme.
Sincerely, Eric Normand <email@example.com>
P.S. I love hearing from readers. Just reply to this email!
This paper describes occurrence typing, a propositional logic-based type inference algorithm which can understand conditionals which branch on type predicates. This is the basis of Typed Racket and Typed Clojure.
The goal of the Herbert project is to provide a convenient schema language for defining edn data structures that can be used for documentation and validation. The schema patterns are represented as edn values.