Substitution in non-wellfounded syntax with variable binding
From MaRDI portal
Recommendations
Cites work
- A framework for defining logics
- An algebraic generalization of Frege structures -- binding algebras
- Basic category theory for models of syntax.
- Coalgebraic monads
- Coequalizers and free triples
- de Bruijn notation as a nested datatype
- Dualising initial algebras
- Explicit substitutions and higher-order syntax
- Generalised folds for nested datatypes
- Generalizing Substitution
- scientific article; zbMATH DE number 1375587 (Why is no real title available?)
- scientific article; zbMATH DE number 3722625 (Why is no real title available?)
- scientific article; zbMATH DE number 1343506 (Why is no real title available?)
- scientific article; zbMATH DE number 1948154 (Why is no real title available?)
- scientific article; zbMATH DE number 1956505 (Why is no real title available?)
- scientific article; zbMATH DE number 2003147 (Why is no real title available?)
- scientific article; zbMATH DE number 1759453 (Why is no real title available?)
- scientific article; zbMATH DE number 2087341 (Why is no real title available?)
- scientific article; zbMATH DE number 1841846 (Why is no real title available?)
- scientific article; zbMATH DE number 2090071 (Why is no real title available?)
- scientific article; zbMATH DE number 1424053 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Infinitary lambda calculus
- Infinite trees and completely iterative theories: A coalgebraic view
- Locus solum: From the rules of logic to the logic of rules.
- Parametric corecursion
- Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
- Reduction of finite and infinite derivations
- Substitution in non-wellfounded syntax with variable binding
- Substitution: A formal methods case study using monads and transformations
Cited in
(18)- Lazy variable-renumbering makes substitution cheap
- A formalized general theory of syntax with bindings
- From signatures to monads in \textsf{UniMath}
- C-system of a module over a \(Jf\)-relative monad
- Some Wellfounded Trees in UniMath
- Substitution in non-wellfounded syntax with variable binding
- scientific article; zbMATH DE number 5360218 (Why is no real title available?)
- Generalizing Substitution
- Heterogeneous substitution systems revisited
- Coproducts of Ideal Monads
- scientific article; zbMATH DE number 7379288 (Why is no real title available?)
- High-level signatures and initial semantics
- Unifying structured recursion schemes. An extended study
- Towards Effects in Mathematical Operational Semantics
- Structured handling of scoped effects
- Substitution for non-wellfounded syntax with binders through monoidal categories
- Explicit substitutions and higher-order syntax
- Modules over monads and initial semantics
This page was built for publication: Substitution in non-wellfounded syntax with variable binding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703526)