Pages that link to "Item:Q5371960"
From MaRDI portal
The following pages link to Well-founded recursion with copatterns and sized types (Q5371960):
Displaying 13 items.
- (Co)inductive proof systems for compositional proofs in reachability logic (Q1996855) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Causal computational complexity of distributed processes (Q2112798) (← links)
- Temporal refinements for guarded recursive types (Q2233479) (← links)
- Friends with Benefits (Q2988636) (← links)
- (Q5094136) (← links)
- (Q5216302) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- (Q5875422) (← links)
- Is sized typing for Coq practical? (Q6099202) (← links)
- Into the Infinite - Theory Exploration for Coinduction (Q6108814) (← links)
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs (Q6649500) (← links)