Aarhus University Seal

Talk: Modular abstract syntax trees (MAST) by Ohad Kammar

Info about event

Time

Tuesday 27 October 2026,  at 13:00 - 14:00

Location

Nygaard 295

We adapt Fiore, Plotkin, and Turi's treatment of abstract syntax with

binding, substitution, and holes to account for languages with

second-class sorts. These situations include programming calculi such

as the Call-by-Value λ-calculus (CBV) and Levy's Call-by-Push-Value

(CBPV). This line of work develops the semantics of abstract syntax as

certain functor categories---presheaves over structural categories for

the judgement structure well-sorted terms. Prohibiting second-class

sorts from appearing in variable contexts means generalising the

substitution tensors of Fiore et al from monoidal categories to

monoidal-action categories, also known as actegories or modular

categories.  Corresponding, the abstract syntax is no longer a monoid,

but a monoid action, or module.

 

In this talk, I will review recent and ongoing work, and its

application to solving the so called Expression Problem in two

scenarios.  We employ the mathematical theory when proving

substitution lemmata for varieties of CBV denotational semantics

modularly. We employ a computational implementation of the theory

when implementing intrinsically-typed foreign-function interfaces for

the 29 theories of SMTLIB.

 

Joint work with Greg Brown, Marcelo Fiore, Kajetan Granops,

Mihail-Codrin Iftode, Georg Moser, and Sam Staton.