Norman Danner

According to our database1, Norman Danner authored at least 24 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Recurrence extraction for functional programs through call-by-push-value.
Proc. ACM Program. Lang., 2020

Denotational recurrence extraction for amortized analysis.
Proc. ACM Program. Lang., 2020

Denotational semantics as a foundation for cost recurrence extraction for functional languages.
CoRR, 2020

2019
Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version).
CoRR, 2019

2015
Denotational cost semantics for functional languages with inductive types.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

2013
A static cost analysis for a higher-order language.
Proceedings of the 7th Workshop on Programming languages meets program verification, 2013

2012
Effectiveness and detection of denial-of-service attacks in tor.
ACM Trans. Inf. Syst. Secur., 2012

Semi-automatic complexity analysis of a higher-order language
CoRR, 2012

Ramified Structural Recursion and Corecursion
CoRR, 2012

2009
Two Algorithms in Search of a Type-System.
Theory Comput. Syst., 2009

Revitalizing computing education through free and open source software for humanity.
Commun. ACM, 2009

Detecting Denial of Service Attacks in Tor.
Proceedings of the Financial Cryptography and Data Security, 2009

2007
Circuit principles and weak pigeonhole variants.
Theor. Comput. Sci., 2007

Adventures in time and space.
Log. Methods Comput. Sci., 2007

Time-complexity semantics for feasible affine recursions (extended abstract)
CoRR, 2007

Time-Complexity Semantics for Feasible Affine Recursions.
Proceedings of the Computation and Logic in the Real World, 2007

2006
The weak pigeonhole principle for function classes in S<sup>1</sup><sub>2</sub>.
Math. Log. Q., 2006

The weak pigeonhole principle for function classes in S^1_2
CoRR, 2006

2004
Minimization and NP multifunctions.
Theor. Comput. Sci., 2004

2001
Ramified Recurrence with Dependent Types.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

1999
Stratified polymorphism and primitive recursion.
Math. Struct. Comput. Sci., 1999

Ordinals and Ordinal Functions Representable in the Simply Typed lambda Calculus.
Ann. Pure Appl. Log., 1999

1997
On the Foundations of Corecursion.
Log. J. IGPL, 1997

1996
Towards a model theory of diagrams.
J. Philos. Log., 1996


  Loading...