Catala: a programming language for the law

Abstract

Law at large underpins modern society, codifying and governing many aspects of citizens' daily lives. Oftentimes, law is subject to interpretation, debate and challenges throughout various courts and jurisdictions. But in some other areas, law leaves little room for interpretation, and essentially aims to rigorously describe a computation, a decision procedure or, simply said, an algorithm. Unfortunately, prose remains a woefully inadequate tool for the job. The lack of formalism leaves room for ambiguities; the structure of legal statutes, with many paragraphs and sub-sections spread across multiple pages, makes it hard to compute the intended outcome of the algorithm underlying a given text; and, as with any other piece of poorly-specified critical software, the use of informal, natural language leaves corner cases unaddressed. We introduce Catala, a new programming language that we specifically designed to allow a straightforward and systematic translation of statutory law into an executable implementation. Notably, Catala makes it natural and easy to express the general case / exceptions logic that permeates statutory law. Catala aims to bring together lawyers and programmers through a shared medium, which together they can understand, edit and evolve, bridging a gap that too often results in dramatically incorrect implementations of the law. We have implemented a compiler for Catala, and have proven the correctness of its core compilation steps using the F* proof assistant. We evaluate Catala on several legal texts that are algorithms in disguise, notably section 121 of the US federal income tax and the byzantine French family benefits; in doing so, we uncover a bug in the official implementation of the French benefits. We observe as a consequence of the formalization process that using Catala enables rich interactions between lawyers and programmers, leading to a greater understanding of the original legislative intent, while producing a correct-by-construction executable specification reusable by the greater software ecosystem. Doing so, Catala increases trust in legal institutions, and mitigates the risk of societal damage due to incorrect implementations of the law.

Mapping the Issues of Automated Legal Systems: Why Worry About Automatically Processable Regulation?

“…Esposito 2021)-and how computer programs with low degrees of mediation by humans (e.g., data-driven unsupervised learning systems) challenge the notion of transparency. Technical remedies to address the lack of transparency have been proposed (for instance with Catala, Merigoux et al 2021), yet not necessarily focused on the field of APR. Even if more transparent APRs exist, transparency should not be reduced to its informational dimension, which presupposes that individuals will understand information and thereby control (i.e., decide) how to interact with automated decision-making systems (Felzmann et al 2019) or APR.…”

From Legal Contracts to Legal Calculi: the code-driven normativity

“…Accordingly, several projects are being developed for defining code-driven legal contracts, e.g. [30,17,37,28,24,11,31]. We focus here in the problem of defining suitable programming languages to write legal contracts, since finding the suitable abstraction level for legal languages is still an open issue.…”

rgpdOS: GDPR Enforcement By The Operating System

“…However, bringing computer science and law together is not an easy task [13,14]. The law mainly targets the new opportunities and dangers that information technologies create.…”