2004
DOI: 10.1016/j.tcs.2004.07.025
|View full text |Cite
|
Sign up to set email alerts
|

Substitution in non-wellfounded syntax with variable binding

Abstract: Inspired from the recent developments in theories of non-wellfounded syntax (coinductively defined languages) and of syntax with binding operators, the structure of algebras of wellfounded and non-wellfounded terms is studied for a very general notion of signature permitting both simple variable binding operators as well as operators of explicit substitution. This is done in an extensional mathematical setting of initial algebras and final coalgebras of endofunctors on a functor category. The main technical to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
66
0

Year Published

2004
2004
2022
2022

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 30 publications
(66 citation statements)
references
References 38 publications
0
66
0
Order By: Relevance
“…Future work includes extending the substitution and solution theorems to signatures with binding and explicit substitution operators (joint project of the author with Ralph Matthes, the substitution theorem appears in [15]), proving the free completely iterative monad theorem of [2] for generalized substitution (this will take generalizing their concept of ideal monad), a study of the pragmatics of generalized redecoration, and also a detailed comparison of the concept of substitutioncarrying monad employed here to that of coalgebraic monad by Ghani et al [11].…”
Section: Discussionmentioning
confidence: 99%
“…Future work includes extending the substitution and solution theorems to signatures with binding and explicit substitution operators (joint project of the author with Ralph Matthes, the substitution theorem appears in [15]), proving the free completely iterative monad theorem of [2] for generalized substitution (this will take generalizing their concept of ideal monad), a study of the pragmatics of generalized redecoration, and also a detailed comparison of the concept of substitutioncarrying monad employed here to that of coalgebraic monad by Ghani et al [11].…”
Section: Discussionmentioning
confidence: 99%
“…Roughly speaking, the difference between Nom and Set F is that the latter already comes equipped with a notion of substitution, see [Sta07, Section 7.3] for details. [MU04] further develop substitution for algebraic and coalgebraic datatypes over presheaf-categories and describe the set of infinitary λ-terms as a final coalgebra. [AMV11] furthermore study the so-called rational fixed point, again over Set F , as a semantic universe for solutions of higher-order recursion schemes.…”
Section: Related and Future Workmentioning
confidence: 99%
“…[2,11,18]) although some other settings have been considered. Notably in [6] the authors work within a setting roughly based on operads (although they do not write this word down; the definition of operad is on Wikipedia; operads and monads are not too far from each other).…”
Section: Conclusion and Related Workmentioning
confidence: 99%