The following pages link to Copatterns (Q2931780):
Displayed 24 items.
- Undecidability of equality for codata types (Q1798783) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)
- Regular Varieties of Automata and Coequations (Q2941177) (← links)
- Turing-Completeness Totally Free (Q2941179) (← links)
- A Mechanized Theory of Regular Trees in Dependent Type Theory (Q2945653) (← links)
- Dualized Simple Type Theory (Q2974773) (← links)
- Friends with Benefits (Q2988636) (← links)
- (Q3121528) (← links)
- How to Reason Coinductively Informally (Q3305562) (← links)
- (Q4580329) (← links)
- A realizability interpretation of Church's simple theory of types (Q4593235) (← links)
- (Q5002798) (← links)
- Cubical Agda: A dependently typed programming language with univalence and higher inductive types (Q5016211) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- (Q5020623) (← links)
- (Q5089035) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- Elaborating dependent (co)pattern matching: No pattern left behind (Q5110925) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- Well-founded recursion with copatterns and sized types (Q5371960) (← links)
- Interactive programming in Agda – Objects and graphical user interfaces (Q5372002) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
- A model of guarded recursion with clock synchronisation (Q5971393) (← links)
- Classical (co)recursion: Mechanics (Q6132720) (← links)