Author:
Wang Yuting,Nadathur Gopalan
Publisher
Springer Berlin Heidelberg
Reference38 articles.
1. Lecture Notes in Computer Science;A Ahmed,2006
2. Appel, A.W., McAllester, D.: An indexed model of recursive types for foundational proof-carrying code. ACM Trans. Program. Lang. Syst. 23(5), 657–683 (2001)
3. Lecture Notes in Computer Science;BE Aydemir,2005
4. Baelde, D., Chaudhuri, K., Gacek, A., Miller, D., Nadathur, G., Tiu, A., Wang, Y.: Abella: a system for reasoning about relational specifications. J. Formalized Reasoning 7(2), 1–89 (2014)
5. Baelde, D., Nadathur, G.: Combining deduction modulo and logics of fixed-point definitions. In: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, pp. 105–114. IEEE Computer Society (2012)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Verified Transformation of Continuation-Passing Style into Static Single Assignment Form;Theoretical Aspects of Software Engineering;2023
2. Fifty Years of Prolog and Beyond;Theory and Practice of Logic Programming;2022-05-17
3. A Survey of the Proof-Theoretic Foundations of Logic Programming;Theory and Practice of Logic Programming;2021-11-18
4. Mechanized Metatheory Revisited;Journal of Automated Reasoning;2018-10-04
5. Schematic Polymorphism in the Abella Proof Assistant;Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming;2018-09-03