Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic-Reference-Cited by-同舟云学术

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic

Published:2017 Issue: Volume: Page:3-21
ISSN:0302-9743
Container-title:Frontiers of Combining Systems
language:
Short-container-title:

Author:

Biendarra Julian,Blanchette Jasmin Christian,Bouzy Aymeric,Desharnais Martin,Fleury Mathias,Hölzl Johannes,Kunčar Ondřej,Lochbihler Andreas,Meier Fabian,Panny Lorenz,Popescu Andrei,Sternagel Christian,Thiemann René,Traytel Dmitriy

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-66167-4_1

Reference54 articles.

1. Bartels, F.: Generalised coinduction. Math. Struct. Comput. Sci. 13(2), 321–348 (2003)

2. Becker, H., Blanchette, J.C., Waldmann, U., Wand, D.: Formalization of Knuth–Bendix orders for lambda-free higher-order terms. Archive of Formal Proofs (2016). Formal proof development. http://isa-afp.org/entries/Lambda_Free_KBOs.shtml

3. Lecture Notes in Computer Science;H Becker,2017

4. Lecture Notes in Computer Science;S Berghofer,1999

5. Texts in Theoretical Computer Science;Y Bertot,2004

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Some techniques for reasoning automatically on co-inductive data structures;Journal of Logic and Computation;2023-06-06

2. A Type-Based Approach to Divide-and-Conquer Recursion in Coq;Proceedings of the ACM on Programming Languages;2023-01-09

3. Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover;Journal of Automated Reasoning;2020-06-17

4. Formal Verification of Executable Complementation and Equivalence Checking for Büchi Automata;Lecture Notes in Computer Science;2020

5. Bisimulation and Coinduction Enhancements: A Historical Perspective;Formal Aspects of Computing;2019-12