The following pages link to (Q4790656):
Displaying 21 items.
- Coalgebras in functional programming and type theory (Q639643) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- General recursive functions in a very simply interpretable typed \(\lambda\)-calculus (Q1314352) (← links)
- Conservativity of nested relational calculi with internal generic functions (Q1321813) (← links)
- Nested abstract syntax in Coq (Q1945918) (← links)
- Representations and the foundations of mathematics (Q2134273) (← links)
- Recursive coalgebras from comonads (Q2495640) (← links)
- Indexed induction-recursion (Q2577476) (← links)
- Simple general recursion in type theory (Q2743705) (← links)
- Type theory should eat itself (Q2804938) (← links)
- Another look at function domains (Q2805150) (← links)
- Inductive and coinductive components of corecursive functions in Coq (Q2873661) (← links)
- Turing-Completeness Totally Free (Q2941179) (← links)
- A Type of Partial Recursive Functions (Q3543653) (← links)
- Untyped Recursion Schemes and Infinite Intersection Types (Q3557861) (← links)
- A simple canonical representation of rational numbers (Q4924543) (← links)
- Numbering matters (Q5178033) (← links)
- General Recursion via Coinductive Types (Q5310638) (← links)
- Typed Lambda Calculi and Applications (Q5704004) (← links)
- (Q5884946) (← links)
- Logical Approaches to Computational Barriers (Q5898846) (← links)