Author:
Endrullis Jörg,Grabmayer Clemens,Hendriks Dimitri
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Buchholz, W.: A Term Calculus for (Co-)Recursive Definitions on Streamlike Data Structures. Annals of Pure and Applied Logic 136(1-2), 75–90 (2005)
2. Endrullis, J., Grabmayer, C., Hendriks, D.: Data-Oblivious Stream Productivity. Technical report (2008),
http://arxiv.org/pdf/0806.2680
3. Lecture Notes in Computer Science;J. Endrullis,2007
4. Hughes, J., Pareto, L., Sabry, A.: Proving the Correctness of Reactive Systems Using Sized Types. In: POPL 1996, pp. 410–423 (1996)
5. Kapur, D., Narendran, P., Rosenkrantz, D.J., Zhang, H.: Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28(4), 311–350 (1991)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. AN OPERATIONAL INTERPRETATION OF COINDUCTIVE TYPES;LOG METH COMPUT SCI;2020
2. Well-definedness and observational equivalence for inductive–coinductive programs;Journal of Logic and Computation;2019-06-06
3. On periodically iterated morphisms;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
4. On the complexity of stream equality;Journal of Functional Programming;2014-01-20
5. Behavioral Rewrite Systems and Behavioral Productivity;Specification, Algebra, and Software;2014