The following pages link to (Q4524982):
Displayed 8 items.
- Safe recursion revisited. I: Categorical semantics for lower complexity (Q386608) (← links)
- Some properties of coalgebras and their rôle in computer science (Q2659403) (← links)
- Executable Relational Specifications of Polymorphic Type Systems Using Prolog (Q2798266) (← links)
- A Categorical Setting for Lower Complexity (Q3178259) (← links)
- Two extensions of system F with (co)iteration and primitive (co)recursion principles (Q3653093) (← links)
- When is a function a fold or an unfold? (Q4917036) (← links)
- (Q5020623) (← links)
- Some Remarks on Type Systems for Course-of-value Recursion (Q5178964) (← links)