85 citations · 103 across the 13 of their papers we have counts for
3 papers · 1 filter
Union and intersection contracts are hard, actually
Teodoro Freund, Yann Hamdaoui, Arnaud Spiwack
Union and intersection types are a staple of gradually typed language such as TypeScript. While it's long been recognized that union and intersection types are difficult to verify…
Evaluating Linear Functions to Symmetric Monoidal Categories
Jean-Philippe Bernardy, Arnaud Spiwack
A number of domain specific languages, such as circuits or data-science workflows, are best expressed as diagrams of boxes connected by wires. Unfortunately, functional languages h…
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…