scientific article; zbMATH DE number 7577567
From MaRDI portal
Publication:5101336
Tom Hirschowitz, Ambroise Lafont, Andre Hirschowitz
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2012.06530
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A categorical framework for congruence of applicative bisimilarity in higher-order languages ⋮ Variable binding and substitution for (nameless) dummies ⋮ Variable binding and substitution for (nameless) dummies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- A new approach to abstract syntax with variable binding
- Modules over monads and initial semantics
- On the construction of free algebras for equational systems
- A left adjoint construction related to free triples
- On the monadicity of finitary monads
- Substitution: A formal methods case study using monads and transformations
- Skew confluence and the lambda calculus with letrec
- The differential lambda-calculus
- Combinatorial structure of type dependency
- Coequalizers and free triples
- Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
- Tensors, monads and actions
- Coproducts of Monads on Set
- A Categorical Semantics for Inductive-Inductive Definitions
- Differential categories
- Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic
- Modules over Monads and Linearity
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- Bisimulation can't be traced
- An introduction to differential linear logic: proof-nets, models and antiderivatives
- Call-by-value Solvability
- The linear-non-linear substitution 2-monad
- High-level signatures and initial semantics
- A Fresh Look at the λ-Calculus
- List Objects with Algebraic Structure
- Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
- Algebraic models of simple type theories
- A Cellular Howe Theorem
- Monads need not be endofunctors
- Initiality for Typed Syntax and Semantics
- Abstract Syntax: Substitution and Binders
- Programming Languages and Systems
- Modules over relative monads for syntax and semantics
