On Computational Law: Why the History of Computing Could Be the Future of Law

The government of Singapore recently bet ten million dollars on a research program to develop an open-source domain-specific language - for law. This talk explains why, and introduces lesser-known corners of computer science (like formal methods, controlled natural languages, and logic and constraint programming) and suggests that together they could permanently divide the traditional legal profession (which runs on humans) from a future legal industry (which runs on computers).

This talk offers a quick tour of useful theory that every self-taught hacker should be acquainted with, and shows how they solve problems in law. Lesser known chapters from the history of computing will be examined, such as formal verification, the temporal logics LTL and CTL, decision tables, DSLs, constraint satisfaction, and model checking, as well as strongly-typed languages for natural language generation. You will see how KRR (knowledge representation and reasoning) could move out of the heads of lawyers and into a computer. This talk outlines a plan for a domain-specific language for law, following the ethos of open source and open standards that promises to make it possible for hackers, consumers, and non-lawyers to get certain legal jobs done by themselves - not by going to a law firm, but by going to GitHub.