| 2007 |
|---|
| 15 | EE | Norman Danner,
James S. Royer:
Time-Complexity Semantics for Feasible Affine Recursions.
CiE 2007: 205-217 |
| 14 | EE | Norman Danner,
James S. Royer:
Two algorithms in search of a type system
CoRR abs/0710.0824: (2007) |
| 13 | EE | Norman Danner,
James S. Royer:
Time-complexity semantics for feasible affine recursions (extended abstract)
CoRR abs/cs/0701076: (2007) |
| 12 | EE | Norman Danner,
James S. Royer:
Adventures in time and space.
Logical Methods in Computer Science 3(1): (2007) |
| 11 | EE | Chris Pollett,
Norman Danner:
Circuit principles and weak pigeonhole variants.
Theor. Comput. Sci. 383(2-3): 115-131 (2007) |
| 2006 |
|---|
| 10 | EE | Norman Danner,
James S. Royer:
Adventures in time and space.
POPL 2006: 168-179 |
| 9 | EE | Norman Danner,
Chris Pollett:
The weak pigeonhole principle for function classes in S^1_2
CoRR abs/cs/0608039: (2006) |
| 8 | EE | Norman Danner,
James S. Royer:
Adventures in time and space
CoRR abs/cs/0612116: (2006) |
| 7 | EE | Norman Danner,
Chris Pollett:
The weak pigeonhole principle for function classes in S12.
Math. Log. Q. 52(6): 575-584 (2006) |
| 2005 |
|---|
| 6 | EE | Chris Pollett,
Norman Danner:
Circuit Principles and Weak Pigeonhole Variants.
CATS 2005: 31-40 |
| 2004 |
|---|
| 5 | EE | Norman Danner,
Chris Pollett:
Minimization and NP multifunctions.
Theor. Comput. Sci. 318(1-2): 105-119 (2004) |
| 2001 |
|---|
| 4 | EE | Norman Danner:
Ramified Recurrence with Dependent Types.
TLCA 2001: 91-105 |
| 1999 |
|---|
| 3 | | Norman Danner:
Ordinals and Ordinal Functions Representable in the Simply Typed lambda Calculus.
Ann. Pure Appl. Logic 97(1-3): 179-201 (1999) |
| 2 | | Norman Danner,
Daniel Leivant:
Stratified polymorphism and primitive recursion.
Mathematical Structures in Computer Science 9(4): 507-522 (1999) |
| 1997 |
|---|
| 1 | EE | Lawrence S. Moss,
Norman Danner:
On the Foundations of Corecursion.
Logic Journal of the IGPL 5(2): (1997) |
