Norman Danner
Norman Danner
Associate Professor of Computer Science, Wesleyan University
Verified email at
Cited by
Cited by
Revitalizing computing education through free and open source software for humanity.
R Morelli, AB Tucker, N Danner, TR De Lanerolle, HJC Ellis, ÷ Izmirli, ...
Commun. ACM 52 (8), 67-75, 2009
Denotational cost semantics for functional languages with inductive types
N Danner, DR Licata, R Ramyaa
ACM International Conference on Functional Programming (ICFP '15), 140-151, 2015
Towards a model theory of diagrams
E Hammer, N Danner
Journal of Philosophical Logic 25 (5), 463-482, 1996
A static cost analysis for a higher-order language
N Danner, J Paykin, JS Royer
Proceedings of the 7th workshop on Programming languages meets program†…, 2013
On the foundations of corecursion
LS Moss, N Danner
Logic Journal of the IGPL 5 (2), 231-257, 1997
Recurrence extraction for functional programs through call-by-push-value
GA Kavvos, E Morehouse, DR Licata, N Danner
Proceedings of the ACM on Programming Languages 4 (POPL), 1-31, 2019
Effectiveness and detection of denial-of-service attacks in Tor
N Danner, S Defabbia-Kane, D Krizanc, M Liberatore
ACM Transactions on Information and System Security (TISSEC) 15 (3), 11, 2012
Adventures in time and space
N Danner, JS Royer
ACM Conference of Principles of Programming Languages (POPL '06), 168-179, 2006
Detecting denial of service attacks in Tor
N Danner, D Krizanc, M Liberatore
International Conference on Financial Cryptography and Data Security, 273-284, 2009
Denotational recurrence extraction for amortized analysis
JW Cutler, DR Licata, N Danner
Proceedings of the ACM on Programming Languages 4 (ICFP), 1-29, 2020
Stratified polymorphism and primitive recursion
N Danner, D Leivant
Mathematical Structures in Computer Science 9 (4), 507-522, 1999
Creating an academic community to build humanitarian foss: A progress report
T de Lanerolle, R Morelli, N Danner, D Krizanc, G Parker, O Izmirli
Proceedings of the 5th International ISCRAM Conference, 337-341, 2008
Ordinals and ordinal functions representable in the simply typed lambda calculus
N Danner
Annals of Pure and Applied Logic 97 (1-3), 179-201, 1999
Ramified structural recursion and corecursion
N Danner, JS Royer
arXiv preprint arXiv:1201.4567, 2012
Two algorithms in search of a type-system
N Danner, JS Royer
Theory of Computing Systems 45 (4), 787-821, 2009
Ordinal notations in typed lambda-calculi.
N Danner
Minimization and NP multifunctions
N Danner, C Pollett
Theoretical computer science 318 (1-2), 105-119, 2004
Denotational semantics as a foundation for cost recurrence extraction for functional languages
N Danner, DR Licata
Journal of Functional Programming 32, 2022
Simulation of circuit creation in tor: Preliminary results
W Boyd, N Danner, D Krizanc
Proceedings of the 4th Hot Topics in Privacy Enhancing Technologies, 41-48, 2011
Circuit principles and weak pigeonhole variants
C Pollett, N Danner
Theoretical Computer Science 383 (2-3), 115-131, 2007
The system can't perform the operation now. Try again later.
Articles 1–20