Author:
Goncharov Sergey,Schröder Lutz,Rauch Christoph,Piróg Maciej
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Aczel, P., Adámek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: a coalgebraic view. Theoret. Comput. Sci. 300(1–3), 1–45 (2003)
2. Adámek, J., Milius, S., Velebil, J.: Equational properties of iterative monads. Inf. Comput. 208, 1306–1348 (2010)
3. Adámek, J., Milius, S., Velebil, J.: Elgot theories: a new perspective of the equational properties of iteration. Math. Struct. Comput. Sci. 21, 417–480 (2011)
4. Altenkirch, T., Danielsson, N.: Partiality, revisited. In: Types for Proofs and Programs, TYPES 2016 (2016)
5. Atkey, R.: Parameterised notions of computation. J. Funct. Prog. 19, 335 (2009)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Shades of Iteration: From Elgot to Kleene;Recent Trends in Algebraic Development Techniques;2023
2. A metalanguage for guarded iteration;Theoretical Computer Science;2021-04
3. Implementing Hybrid Semantics: From Functional to Imperative;Theoretical Aspects of Computing – ICTAC 2020;2020
4. Interaction trees: representing recursive and impure programs in Coq;Proceedings of the ACM on Programming Languages;2020-01
5. An Adequate While-Language for Hybrid Computation;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07