Publisher
Springer International Publishing
Reference28 articles.
1. A. Abel, B. Pientka, Wellfounded recursion with copatterns: a unified approach to termination and productivity, in ACM SIGPLAN International Conference on Functional Programming, ICFP’13, Boston, MA, USA, 25–27 Sept 2013, ed. by G. Morrisett, T. Uustalu (ACM, 2013), pp. 185–196
2. A. Abel, B. Pientka, D. Thibodeau, A. Setzer, Copatterns: programming infinite structures by observations, in Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL’13, ed. by R. Giacobazzi, R. Cousot (ACM, New York, NY, USA, 2013), pp. 27–38
3. P. Aczel, Non-wellfounded Set Theory, vol. 14, CSLI Lecture Notes (Stanford University, Center for the Study of Language and Information, Stanford, CA, 1988)
4. P. Aczel, Algebras and coalgebras, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, vol. 2297, Lecture Notes in Computer Science, ed. by R. Backhouse, R. Crole, J. Gibbons (Springer, 2002), pp. 79–88
5. P. Aczel, N. Mendler, A final coalgebra theorem, in Category Theory and Computer Science, vol. 389, Lecture Notes in Computer Science, ed. by D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts, A. Poigné (Springer, Berlin/Heidelberg, 1989), pp. 357–365. doi: 10.1007/BFb0018361
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献