The following pages link to Norman Danner (Q733752):
Displayed 15 items.
- Two algorithms in search of a type-system (Q733753) (← links)
- Item:Q733752 (redirect page) (← links)
- Ordinals and ordinal functions representable in the simply typed lambda calculus (Q1302304) (← links)
- Towards a model theory of diagrams (Q1815406) (← links)
- Minimization and \(\mathbf{NP}\) multifunctions (Q1827394) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Denotational cost semantics for functional languages with inductive types (Q2981951) (← links)
- On the Foundations of Corecursion (Q3126405) (← links)
- (Q3149662) (← links)
- The weak pigeonhole principle for function classes inS12 (Q3418087) (← links)
- Stratified polymorphism and primitive recursion (Q4704766) (← links)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)
- Adventures in time and space (Q5310685) (← links)
- Adventures in time and space (Q5348922) (← links)
- Time-Complexity Semantics for Feasible Affine Recursions (Q5425322) (← links)