Towards a model theory of diagrams. - Eric Hammer; Norman Danner (J. Philos. Log., 1996)

On the Foundations of Corecursion. - Lawrence S. Moss; Norman Danner (Log. J. IGPL, 1997)

Ordinals and Ordinal Functions Representable in the Simply Typed lambda Calculus. - Norman Danner (Ann. Pure Appl. Log., 1999)

Stratified polymorphism and primitive recursion. - Norman Danner; Daniel Leivant (Math. Struct. Comput. Sci., 1999)

Ramified Recurrence with Dependent Types. - Norman Danner (TLCA, 2001)

Minimization and NP multifunctions. - Norman Danner; Chris Pollett (Theor. Comput. Sci., 2004)

The weak pigeonhole principle for function classes in S^1_2 - Norman Danner; Chris Pollett (CoRR, 2006)

The weak pigeonhole principle for function classes in S12. - Norman Danner; Chris Pollett (Math. Log. Q., 2006)

Time-Complexity Semantics for Feasible Affine Recursions. - Norman Danner; James S. Royer (CiE, 2007)

Time-complexity semantics for feasible affine recursions (extended abstract) - Norman Danner; James S. Royer (CoRR, 2007)

Adventures in time and space. - Norman Danner; James S. Royer (Log. Methods Comput. Sci., 2007)

Circuit principles and weak pigeonhole variants. - Chris Pollett; Norman Danner (Theor. Comput. Sci., 2007)

Detecting Denial of Service Attacks in Tor. - Norman Danner; Danny Krizanc; Marc Liberatore (Financial Cryptography, 2009)

Revitalizing computing education through free and open source software for humanity. - Ralph A. Morelli; Allen B. Tucker; Norman Danner; Trishan R. de Lanerolle; Heidi J. C. Ellis; Özgür Izmirli; Danny Krizanc; Gary Parker (Commun. ACM, 2009)

Two Algorithms in Search of a Type-System. - Norman Danner; James S. Royer (Theory Comput. Syst., 2009)

Expanding student enthusiasm for, and understanding of, introductory CS: panel discussion. - Bridget Baird; Martin Allen; Christine Chung 001; Norman Danner; Madalene Spezialetti (J. Comput. Sci. Coll., 2010)

Instructional aspects of student participation in humanitarian Free and Open Source Software: panel discussion. - Heidi J. C. Ellis; Gregory W. Hislop; Ralph A. Morelli; Norman Danner (J. Comput. Sci. Coll., 2010)

Ramified Structural Recursion and Corecursion - Norman Danner; James S. Royer (CoRR, 2012)

Semi-automatic complexity analysis of a higher-order language - Norman Danner; Jennifer Paykin; James S. Royer (CoRR, 2012)

Effectiveness and detection of denial-of-service attacks in tor. - Norman Danner; Sam DeFabbia-Kane; Danny Krizanc; Marc Liberatore (ACM Trans. Inf. Syst. Secur., 2012)

A static cost analysis for a higher-order language. - Norman Danner; Jennifer Paykin; James S. Royer (PLPV, 2013)

Denotational cost semantics for functional languages with inductive types. - Norman Danner; Daniel R. Licata; Ramyaa (ICFP, 2015)

Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version). - G. A. Kavvos; Edward Morehouse; Daniel R. Licata; Norman Danner (CoRR, 2019)

Denotational recurrence extraction for amortized analysis. - Joseph W. Cutler; Daniel R. Licata; Norman Danner (Proc. ACM Program. Lang., 2020)

Recurrence extraction for functional programs through call-by-push-value. - G. A. Kavvos; Edward Morehouse; Daniel R. Licata; Norman Danner (Proc. ACM Program. Lang., 2020)

General Ramified Recurrence and Polynomial-time Completeness. - Norman Danner; James S. Royer (CoRR, 2022)

Recurrence extraction and denotational semantics with recursive definitions. - Norman Danner (CoRR, 2022)

Denotational semantics as a foundation for cost recurrence extraction for functional languages. - Norman Danner; Daniel R. Licata (J. Funct. Program., 2022)