Evaluating Linear Functions to Symmetric Monoidal Categories

by   Jean-Philippe Bernardy, et al.

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 have traditionally been ill-equipped to embed this sort of languages. The Arrow abstraction is an approximation, but we argue that it does not capture the right properties. A faithful abstraction is Symmetric Monoidal Categories (SMCs), but,so far,it hasn't been convenient to use. We show how the advent of linear typing in Haskell lets us bridge this gap. We provide a library which lets us program in SMCs with linear functions instead of SMC combinators. This considerably lowers the syntactic overhead of the EDSL to be on par with that of monadic DSLs. A remarkable feature of our library is that, contrary to previously known methods for categories, it does not use any metaprogramming.



There are no comments yet.


page 1

page 2

page 3

page 4


Generic Programming in OCaml

We present a library for generic programming in OCaml, adapting some tec...

Diagrammatic Differentiation for Quantum Machine Learning

We introduce diagrammatic differentiation for tensor calculus by general...

Wiring diagrams as normal forms for computing in symmetric monoidal categories

Applications of category theory often involve symmetric monoidal categor...

Symmetric Monoidal Categories with Attributes

When designing plans in engineering, it is often necessary to consider a...

Comb Diagrams for Discrete-Time Feedback

The data for many useful bidirectional constructions in applied category...

Computational Petri Nets: Adjunctions Considered Harmful

We review some of the endeavors in trying to connect Petri nets with fre...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.