A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Abstract Syntax: Substitution and Binders
2007
Electronical Notes in Theoretical Computer Science
We summarise Fiore et al's paper on variable substitution and binding, then axiomatise it. Generalising their use of the category F of finite sets to model untyped cartesian contexts, we let S be an arbitrary pseudo monad on Cat and consider (S1) op : this generality includes linear contexts, affine contexts, and contexts for the Logic of Bunched Implications. Given a pseudo-distributive law of S over the (partial) pseudo-monad Tcoc − = [(−) op , Set] for free cocompletions, one can define a
doi:10.1016/j.entcs.2007.02.024
fatcat:koq3jtxmyrbh5cfsxllm5hucm4