85 citations · 102 across the 10 of their papers we have counts for
14 papers
Arbitrary Functors as Modalities in a Linear Calculus
Jean-Philippe Bernardy, Andreas Abel
We study modalities in the linear lambda calculus, by interpreting them as endofunctors in monoidal closed categories. We support functors that do not distribute over products, inc…
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…
A Graded Modal Type Theory for Pulse Schedules
Robin Adams, Jean-Philippe Bernardy, Lorenzo Perticone +1
The operations to be performed by a quantum computer are almost invariably given in the form of a quantum circuit. In the final stage of compilation, a quantum circuit must be tran…
Learning Structure-Aware Representations of Dependent Types
Konstantinos Kogkalidis, Orestis Melkonian, Jean-Philippe Bernardy
Agda is a dependently-typed programming language and a proof assistant, pivotal in proof formalization and programming language theory. This paper extends the Agda ecosystem into m…
Algebraic Positional Encodings
Konstantinos Kogkalidis, Jean-Philippe Bernardy, Vikas Garg
We introduce a novel positional encoding strategy for Transformer-style models, addressing the shortcomings of existing, often ad hoc, approaches. Our framework provides a flexible…
Domain-Specific Tensor Languages
Jean-Philippe Bernardy, Patrik Jansson
The tensor notation used in several areas of mathematics is a useful one, but it is not widely available to the functional programming community. In a practical sense, the (embedde…