Norman Danner - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2022

Denotational semantics as a foundation for cost recurrence extraction for functional languagesNorman Danner, Daniel R. Licata. JFP, 32, 2022. [doi]

2020

Denotational recurrence extraction for amortized analysisJoseph W. Cutler, Daniel R. Licata, Norman Danner. PACMPL, 4(ICFP), 2020. [doi]

Recurrence extraction for functional programs through call-by-push-valueG. A. Kavvos, Edward Morehouse, Daniel R. Licata, Norman Danner. PACMPL, 4(POPL), 2020. [doi]

2015

Denotational cost semantics for functional languages with inductive typesNorman Danner, Daniel R. Licata, Ramyaa. ICFP 2015: 140-151 [doi]

2013

A static cost analysis for a higher-order languageNorman Danner, Jennifer Paykin, James S. Royer. plpv 2013: 25-34 [doi]

2012

Effectiveness and detection of denial-of-service attacks in torNorman Danner, Sam DeFabbia-Kane, Danny Krizanc, Marc Liberatore. tissec, 15(3):11, 2012. [doi]

2010

Expanding student enthusiasm for, and understanding of, introductory CS: panel discussionBridget Baird, Martin Allen, Christine Chung 0001, Norman Danner, Madalene Spezialetti. jcscoll, 25(6):100-101, 2010. [doi]

Instructional aspects of student participation in humanitarian Free and Open Source Software: panel discussionHeidi J. C. Ellis, Gregory W. Hislop, Ralph A. Morelli, Norman Danner. jcscoll, 25(6):152-154, 2010. [doi]

2009

2007

Time-Complexity Semantics for Feasible Affine RecursionsNorman Danner, James S. Royer. cie 2007: 205-217 [doi]

Adventures in time and spaceNorman Danner, James S. Royer. lmcs, 3(1), 2007. [doi]

Circuit principles and weak pigeonhole variantsChris Pollett, Norman Danner. TCS, 383(2-3):115-131, 2007. [doi]

2006

Adventures in time and spaceNorman Danner, James S. Royer. POPL 2006: 168-179 [doi]

The weak pigeonhole principle for function classes in S:::1:::::2::Norman Danner, Chris Pollett. mlq, 52(6):575-584, 2006. [doi]

2005

Circuit Principles and Weak Pigeonhole VariantsChris Pollett, Norman Danner. cats 2005: 31-40 [doi]

2004

Minimization and NP multifunctionsNorman Danner, Chris Pollett. TCS, 318(1-2):105-119, 2004. [doi]

2001

Ramified Recurrence with Dependent TypesNorman Danner. tlca 2001: 91-105 [doi]

1999

Ordinals and Ordinal Functions Representable in the Simply Typed lambda CalculusNorman Danner. APAL, 97(1-3):179-201, 1999.

Stratified polymorphism and primitive recursionNorman Danner, Daniel Leivant. mscs, 9(4):507-522, 1999.

1997

On the Foundations of CorecursionLawrence S. Moss, Norman Danner. igpl, 5(2):231-257, 1997. [doi]

1996

Towards a model theory of diagramsEric Hammer, Norman Danner. jphil, 25(5):463-482, 1996. [doi]

Sign in or sign up to see more results.

runs on WebDSL