The following pages link to (Q3138832):
Displaying 6 items.
- Explicit mathematics: power types and overloading (Q556826) (← links)
- Term rewriting theory for the primitive recursive functions (Q674412) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Axioms for strict and lazy functional programs (Q1772783) (← links)
- A flexible type system for the small Veblen ordinal (Q2312096) (← links)
