Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation 2(3), 297–347 (1992)
2. Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. on Computational Logic 13(1) (April 2012)
3. Bertot, Y.: The CtCoq system: Design and architecture. Formal Aspects of Computing 11(3), 225–243 (1999)
4. Lecture Notes in Computer Science;Y. Bertot,1994
5. Boespflug, M., Carbonneaux, Q., Hermant, O.: The λΠ-calculus modulo as a universal proof language. In: Pichardie, D., Weber, T. (eds.) Proceedings of PxTP 2012: Proof Exchange for Theorem Proving, pp. 28–43 (2012)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unification for Subformula Linking under Quantifiers;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09
2. A drag-and-drop proof tactic;Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs;2022-01-11
3. Subformula Linking for Intuitionistic Logic with Application to Type Theory;Automated Deduction – CADE 28;2021
4. On the Power of Substitution in the Calculus of Structures;ACM Transactions on Computational Logic;2015-07-08
5. Equality and fixpoints in the calculus of structures;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