Category Theoretic Semantics for Typed Binding Signatures with Recursion


Power, J. and Tanaka, M., 2008. Category Theoretic Semantics for Typed Binding Signatures with Recursion. Fundamenta Informaticae, 84 (2), pp. 221-240.

Related documents:

PDF (Power_FI_2008_84_2_221.pdf) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (1384kB) | Preview

    Official URL:

    Related URLs:


    We generalise Fiore et al's account of variable binding for untyped cartesian contexts to give an account of binding for either variables or names that may be typed. We do this in an enriched setting, allowing the incorporation of recursion into the analysis. Extending earlier work by us, we axiomatise the notion of context by defining and using the notion of an enriched pseudo-monad S on V-Cat, with leading examples of V given by Set and ωCpo, the latter yielding an account of recursion. Fiore et al implicitly used the pseudo-monad T_{fp} on Cat for small categories with finite products. Given a set A of types, our extension to typed binders and enrichment involves generalising from Fiore et al's use of [F, Set] to [(SA)^{op}, V^{A}]. We define a substitution monoidal structure on [(SA)^{op}, V^{A}], allowing us to give a definition of binding signature at this level of generality, and extend initial algebra semantics to the typed, enriched axiomatic setting. This generalises and axiomatises previouswork by Fiore et al and later authors in particular cases. In particular, it includes the Logic of Bunched Implications and variants, infinitary examples, and structures not previously considered such as those generated by finite limits.


    Item Type Articles
    CreatorsPower, J.and Tanaka, M.
    Related URLs
    URLURL Type
    DepartmentsFaculty of Science > Computer Science
    ID Code26516


    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...