SAMS Subject Classification Number: 4

In computer science a parser is a program that translates strings to a different kind of data structure that can often be represented as a tree. This talk discusses how (certain) parsers can be described as functors from a category of strings to a category of trees. The topic of this work evolved from a Haskell implementation [1] of a proof assistant software, whose syntax is entirely based on bracketed expressions. An example parser, that is considered, operates on such bracketed expressions, which are discussed in detail by Laing [2].

The presentation is based on my Honours project under the supervision of Professor Zurab Janelidze.

[1] G. Feierabend, SOFiA proof assistant, http://81.7.3.57:3000/.

[2] B. Laing, Sketching SOFiA, MSc thesis, Stellenbosch University, 2020.