activity
20162026
most citedLinearly Qualified Types: Generic inference for capabilities and uniqueness

6 citations · 16 across the 8 of their papers we have counts for

collaborators

9 papers

cs.PL2026

Linear Constraints

Arnaud Spiwack, Csongor Kiss, Jean-Philippe Bernardy +2

Linear constraints are the linear counterpart of Haskell's class constraints. Linearly typed parameters allow the programmer to control resources such as file handles and manually…

cs.PL2022★ 1 cited

Eiger: Auditable, executable, flexible legal regulations

Alexander Bernauer, Richard A. Eisenberg

Despite recent advances in communication and automation, regulations are still written in natural-language prose, subject to ambiguity, inconsistency, and incompleteness. How can w…

cs.PL2021

Seeking Stability by being Lazy and Shallow

Gert-Jan Bottu, Richard A. Eisenberg

Designing a language feature often requires a choice between several, similarly expressive possibilities. Given that user studies are generally impractical, we propose using stabil…

cs.PL2021★ 6 cited

Linearly Qualified Types: Generic inference for capabilities and uniqueness

Arnaud Spiwack, Csongor Kiss, Jean-Philippe Bernardy +2

A linear parameter must be consumed exactly once in the body of its function. When declaring resources such as file handles and manually managed memory as linear arguments, a linea…

cs.PL2020★ 2 cited

A graded dependent type system with a usage-aware semantics (extended version)

Pritam Choudhury, Harley Eades, Richard A. Eisenberg +1

Graded Type Theory provides a mechanism to track and reason about resource usage in type systems. In this paper, we develop GraD, a novel version of such a graded dependent type sy…

cs.PL2019★ 2 cited

Kind Inference for Datatypes: Technical Supplement

Ningning Xie, Richard A. Eisenberg, Bruno C. d. S. Oliveira

In recent years, languages like Haskell have seen a dramatic surge of new features that significantly extends the expressive power of their type systems. With these features, the c…