Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development, Coq’Art: the Calculus of Inductive Constructions. Springer, Heidelberg (2004)
2. Bove, A.: Simple general recursion in type theory. Nordic Journal of Computing 8(1), 22–42 (2001)
3. Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. Journal of the ACM 24(1), 44–67 (1977)
4. Castéran, P., Rouillard, D.: Reasoning about parametrized automata. In: Proceedings, 8-th International Conference on Real-Time System, vol. 8, pp. 107–119 (2000)
5. Lecture Notes in Computer Science;T. Coquand,1994
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Squeezing Streams and Composition of Self-stabilizing Algorithms;Formal Techniques for Distributed Objects, Components, and Systems;2019
2. Friends with Benefits;Programming Languages and Systems;2017
3. Soundness and Completeness Proofs by Coinductive Methods;Journal of Automated Reasoning;2016-10-18
4. Witnessing (Co)datatypes;Programming Languages and Systems;2015
5. Unified Classical Logic Completeness;Automated Reasoning;2014