Person. Paweł Sobociński [pawelsobocinski]

Professor
Tallinn University of Technology
https://www.ioc.ee/~pawel/

Backlinks

Person. Matt Earnshaw [mattearnshaw]

PhD Student
Tallinn University of Technology
https://www.mattearnshaw.com/

PhD student (Nov. 2020-) in the Compositionality Group at Tallinn University of Technology under the supervision of Paweł Sobociński.

Matt Earnshaw [mde-0001]

I am a PhD student (Nov. 2020-) in the Compositionality Group at Tallinn University of Technology under the supervision of Paweł Sobociński.

My research interests lie broadly in applications of category theory to computer science.

This website is a forest, and contains some of my notes on various topics. Press Ctrl+K to navigate.

Publications [#246]

Matt Earnshaw

Reference. Regular monoidal languages [earnshaw-sobocinski-2022-rpml]

2024
Matt Earnshaw, Paweł Sobociński
Journal of Logical and Algebraic Methods in Programming
10.1016/j.jlamp.2024.100963

@article{EARNSHAW2024100963,
title = {Regular planar monoidal languages},
journal = {Journal of Logical and Algebraic Methods in Programming},
volume = {139},
pages = {100963},
year = {2024},
issn = {2352-2208},
doi = {https://doi.org/10.1016/j.jlamp.2024.100963},
url = {https://www.sciencedirect.com/science/article/pii/S235222082400021X},
author = {Matthew Earnshaw and Paweł Sobociński},
keywords = {Monoidal categories, String diagrams, Formal language theory, Automata, Cartesian restriction categories},
abstract = {We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of languages of planar string diagrams. We give a pumping lemma for monoidal languages, generalizing the one for words and trees. We use the algebra of monoidal and cartesian restriction categories to investigate the properties of regular monoidal languages, and provide sufficient conditions for their recognizability by deterministic monoidal automata.}
}

Reference. The produoidal algebra of process decomposition [earnshaw-hefford-roman-2024-produoidal]

2024
Matt Earnshaw, Mario Román, James Hefford
CSL 2024
10.4230/LIPIcs.CSL.2024.25

@InProceedings{earnshaw_et_al:LIPIcs.CSL.2024.25,
  author =	{Earnshaw, Matt and Hefford, James and Rom\'{a}n, Mario},
  title =	{{The Produoidal Algebra of Process Decomposition}},
  booktitle =	{32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)},
  pages =	{25:1--25:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-310-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{288},
  editor =	{Murano, Aniello and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.25},
  URN =		{urn:nbn:de:0030-drops-196688},
  doi =		{10.4230/LIPIcs.CSL.2024.25},
  annote =	{Keywords: monoidal categories, profunctors, lenses, duoidal categories}
}

Reference. String-diagrammatic trace theory [earnshaw-sobocinski-2023-trace]

2023
Matt Earnshaw, Paweł Sobociński
MFCS 2023
10.4230/LIPIcs.MFCS.2023.43

@InProceedings{earnshaw_et_al:LIPIcs.MFCS.2023.43,
  author =	{Earnshaw, Matthew and Soboci\'{n}ski, Pawe{\l}},
  title =	{{String Diagrammatic Trace Theory}},
  booktitle =	{48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
  pages =	{43:1--43:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-292-1},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{272},
  editor =	{Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.43},
  URN =		{urn:nbn:de:0030-drops-185770},
  doi =		{10.4230/LIPIcs.MFCS.2023.43},
  annote =	{Keywords: symmetric monoidal categories, Mazurkiewicz traces, asynchronous automata}
}

Reference. Regular monoidal languages [earnshaw-sobocinski-2022-rml]

2022
Matt Earnshaw, Paweł Sobociński
MFCS 2022
10.4230/LIPIcs.MFCS.2022.44

@InProceedings{earnshaw_et_al:LIPIcs.MFCS.2022.44,
  author =	{Earnshaw, Matthew and Soboci\'{n}ski, Pawe{\l}},
  title =	{{Regular Monoidal Languages}},
  booktitle =	{47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
  pages =	{44:1--44:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-256-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{241},
  editor =	{Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.44},
  URN =		{urn:nbn:de:0030-drops-168425},
  doi =		{10.4230/LIPIcs.MFCS.2022.44},
  annote =	{Keywords: monoidal categories, string diagrams, formal language theory, cartesian restriction categories}
}

Preprints and extended abstracts [#247]

Matt Earnshaw

Reference. Context-free languages of string diagrams [earnshaw-román-2024-cfml]

2024
Matt Earnshaw, Mario Román

Reference. Polar interleavings for deadlock-free message-passing [earnshaw-nester-roman-2023-polar-interleavings]

November 1, 2023
Matt Earnshaw, Chad Nester, Mario Román

@unpublished{ehr_contouring_prostar,
  author =	{Earnshaw, Matt and Nester, Chad and Rom\'{a}n, Mario},
  title =	{{Polar Interleavings for Deadlock-Free Message-Passing}},
  year =	{2023},
  annote =    {Extended Abstract}
}

Reference. Presentations of premonoidal categories by devices [earnshaw-nester-roman-2023-presentations-of-premonoidals]

November 1, 2023
Matt Earnshaw, Chad Nester, Mario Román

@unpublished{ehr_contouring_prostar,
  author =	{Earnshaw, Matt and Nester, Chad and Rom\'{a}n, Mario},
  title =	{{Presentations of Premonoidal Categories by Devices}},
  year =	{2023},
  annote =    {Extended Abstract}
}

Reference. Contouring prostar autonomous categories [earnshaw-hefford-roman-2023-contouring-prostar-autonomous]

June 1, 2023
Matt Earnshaw, Mario Román, James Hefford

@unpublished{ehr_contouring_prostar,
  author =	{Earnshaw, Matt and Hefford, James and Rom\'{a}n, Mario},
  title =	{{Contouring Prostar Autonomous Categories}},
  year =	{2023},
  annote =    {Extended Abstract}
}

Selected talks [#248]

Matt Earnshaw

Reference. Monoidal optics are universal [earnshaw-2024-monoidal-optics-talk]

June, 2024
Matt Earnshaw
Applied Category Theory, Oxford
Slides

Reference. From monoidal automata to string diagrams for effects [earnshaw-2024-monoidal-automata-talk]

March, 2024
Matt Earnshaw
TSEM, Tallinn
Slides

Reference. Context-free languages of string diagrams [earnshaw-2024-context-free-string-diagrams-talk]

February 3, 2024
Matt Earnshaw
Estonian-Latvian Theory Days, Randivaljä
Slides

Reference. Presentations of premonoidal categories by devices [earnshaw-2023-presentations-of-premonoidals-talk]

November 22, 2023
Matt Earnshaw
NWPT '23 Västerås
Slides

Reference. Monoidal languages [earnshaw-2023-monoidal-languages-talk]

October 6, 2023
Matt Earnshaw
(i)po(m)set project seminar, online
Slides

Reference. String diagrammatic trace theory [earnshaw-2023-string-diagrammatic-trace-theory-talk]

September 1, 2023
Matt Earnshaw
MFCS '23 Bordeaux
Slides

Reference. Enrichment in bicategories [earnshaw-2023-enrichment-in-bicategories-talk]

July 1, 2023
Matt Earnshaw
Tribute to Bob Walters, Tallinn
Slides

Reference. Natural structure and the dialectic of concept formation [earnshaw-2023-natural-structure-talk]

March 1, 2023
Matt Earnshaw
Lawvere Memorial Meeting, Tallinn
Slides

Reference. Regular monoidal languages [earnshaw-2022-regular-monoidal-languages-talk]

August 1, 2022
Matt Earnshaw
MFCS '22 Vienna, SYCO 9 Como, NWPT '22 Bergen
Slides

Teaching [mde-0019]

March 13, 2024
Matt Earnshaw

Spring 2024 — Functional Programming
Spring 2023 — Intro to Category Theory and its Applications
Spring 2022 — Functional Programming
Spring 2021 — Intro to Category Theory and its Applications

Other projects [mde-0024]

March 13, 2024
Matt Earnshaw

Warlpiri kinship from a neo-Riemannian point of view, with Thomas Holder, Séminaire MaMuPhi @ IRCAM, Paris, November 2023.
Myth, Math & Marriage: A Primer in Mathematical Anthropology, with Thomas Holder - PAF Summer University, Hauts-de-France, August 2022.
Miscellaneous scanned papers

Background [mde-0025]

March 13, 2024
Matt Earnshaw

2016–2020 — I was senior software developer in the Silver Lab, Department of Neuroscience, University College London.
2015 — I obtained a Masters degree in Physics from Imperial College London.

matt@earnshaw.org.uk

Contributions

Reference. Regular monoidal languages [earnshaw-sobocinski-2022-rpml]

2024
Matt Earnshaw, Paweł Sobociński
Journal of Logical and Algebraic Methods in Programming
10.1016/j.jlamp.2024.100963

@article{EARNSHAW2024100963,
title = {Regular planar monoidal languages},
journal = {Journal of Logical and Algebraic Methods in Programming},
volume = {139},
pages = {100963},
year = {2024},
issn = {2352-2208},
doi = {https://doi.org/10.1016/j.jlamp.2024.100963},
url = {https://www.sciencedirect.com/science/article/pii/S235222082400021X},
author = {Matthew Earnshaw and Paweł Sobociński},
keywords = {Monoidal categories, String diagrams, Formal language theory, Automata, Cartesian restriction categories},
abstract = {We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of languages of planar string diagrams. We give a pumping lemma for monoidal languages, generalizing the one for words and trees. We use the algebra of monoidal and cartesian restriction categories to investigate the properties of regular monoidal languages, and provide sufficient conditions for their recognizability by deterministic monoidal automata.}
}

Reference. String-diagrammatic trace theory [earnshaw-sobocinski-2023-trace]

2023
Matt Earnshaw, Paweł Sobociński
MFCS 2023
10.4230/LIPIcs.MFCS.2023.43

@InProceedings{earnshaw_et_al:LIPIcs.MFCS.2023.43,
  author =	{Earnshaw, Matthew and Soboci\'{n}ski, Pawe{\l}},
  title =	{{String Diagrammatic Trace Theory}},
  booktitle =	{48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
  pages =	{43:1--43:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-292-1},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{272},
  editor =	{Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.43},
  URN =		{urn:nbn:de:0030-drops-185770},
  doi =		{10.4230/LIPIcs.MFCS.2023.43},
  annote =	{Keywords: symmetric monoidal categories, Mazurkiewicz traces, asynchronous automata}
}

Reference. Regular monoidal languages [earnshaw-sobocinski-2022-rml]

2022
Matt Earnshaw, Paweł Sobociński
MFCS 2022
10.4230/LIPIcs.MFCS.2022.44

@InProceedings{earnshaw_et_al:LIPIcs.MFCS.2022.44,
  author =	{Earnshaw, Matthew and Soboci\'{n}ski, Pawe{\l}},
  title =	{{Regular Monoidal Languages}},
  booktitle =	{47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
  pages =	{44:1--44:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-256-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{241},
  editor =	{Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.44},
  URN =		{urn:nbn:de:0030-drops-168425},
  doi =		{10.4230/LIPIcs.MFCS.2022.44},
  annote =	{Keywords: monoidal categories, string diagrams, formal language theory, cartesian restriction categories}
}