Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
ALGOL-like languages (v.2)
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
From Action Calculi to Linear Logic
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
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
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Mathematical models of computational and combinatorial structures
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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.00 |
We apply the theory of binding algebra to syntax with linear binders. We construct a category of models for a linear binding signature. The initial model serves as abstract syntax for the signature. Moreover it contains structure for modelling simultaneous substitution. We use the presheaf category on the free strict symmetric monoidal category on 1 to construct models of each binding signature. This presheaf category has two monoidal structures, one of which models pairing of terms and the other simultaneous substitution.