Norman Danner

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Denotational semantics as a foundation for cost recurrence extraction for functional languages Journal of Functional Programming	2022-09-02	Paper
Adventures in time and space Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages	2017-08-21	Paper
Denotational cost semantics for functional languages with inductive types Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming	2017-05-10	Paper
Two algorithms in search of a type-system Theory of Computing Systems	2009-10-19	Paper
Time-Complexity Semantics for Feasible Affine Recursions Lecture Notes in Computer Science	2007-11-13	Paper
Adventures in time and space Logical Methods in Computer Science	2007-10-11	Paper
Circuit principles and weak pigeonhole variants Theoretical Computer Science	2007-09-19	Paper
The weak pigeonhole principle for function classes inS12 MLQ	2007-02-02	Paper
Minimization and \(\mathbf{NP}\) multifunctions Theoretical Computer Science	2004-08-06	Paper
scientific article; zbMATH DE number 1808199 (Why is no real title available?)	2002-09-30	Paper
Stratified polymorphism and primitive recursion Mathematical Structures in Computer Science	2000-05-04	Paper
Ordinals and ordinal functions representable in the simply typed lambda calculus Annals of Pure and Applied Logic	2000-03-13	Paper
On the Foundations of Corecursion Logic Journal of the IGPL	1997-06-02	Paper
Towards a model theory of diagrams Journal of Philosophical Logic	1996-11-12	Paper
Transfinite iteration functionals and ordinal arithmetic (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Norman Danner