Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
ALGOL-like languages (v.2)
Semantic analysis of normalisation by evaluation for typed lambda calculus
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
From Action Calculi to Linear Logic
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A framework for typed HOAS and semantics
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science - Selected papers of CMCS'03
A unified category-theoretic formulation of typed binding signatures
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Pseudo-distributive laws and axiomatics for variable binding
Higher-Order and Symbolic Computation
Abstract Syntax: Substitution and Binders
Electronic Notes in Theoretical Computer Science (ENTCS)
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Fundamenta Informaticae - Logic for Pragmatics
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics of higher-order recursion schemes
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Binding signatures for generic contexts
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Fundamenta Informaticae - Logic for Pragmatics
Hi-index | 0.01 |
We give a general category theoretic formulation of the approach to modelling variable binding first proposed by Fiore, Plotkin, and Turi. This general formulation allows us to include variable binding as they have it, as well as Tanaka's linear variable binding and variable binding for other binders and for mixtures of binders as for instance in the Logic of Bunched Implications. The key structure developed by Fiore et al. was a substitution monoidal structure, from which their formulation of binding was derived; so we give an abstract formulation of a substitution monoidal structure, then, at that level of generality, derive the various category theoretic structures they considered. The central construction we use is that of a pseudo-distributive law between 2-monads on Cat, which suffices to induce a pseudo-monad on Cat, and hence a substitution monoidal structure on the free object on 1.