Nils Anders Danielsson

Showing 9 publications

2013

Isomorphism is equality

Thierry Coquand, Nils Anders Danielsson
Indagationes Mathematicae. Vol. 24 (4), p. 1105-1120
Journal article
2008

Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures

Nils Anders Danielsson
35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'08; San Francisco, CA; United States; 7 January 2008 through 12 January 2008, p. 133-144
Paper in proceedings
2007

Functional Program Correctness Through Types

Nils Anders Danielsson
Doctoral thesis
2007

A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family

Nils Anders Danielsson
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. LNCS 4502, p. 93-109
Paper in proceedings
2006

Fast and Loose Reasoning is Morally Correct

Nils Anders Danielsson, John Hughes, Patrik Jansson et al
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2006), p. 206-217
Paper in proceedings
2004

Chasing Bottoms: A Case Study in Program Verification in the Presence of Partial and Infinite Values

Nils Anders Danielsson, Patrik Jansson
Proceedings of the 7th International Conference on Mathematics of Program Construction, MPC 2004, LNCS 3125, p. 85-109
Paper in proceedings

Save references

If you have installed Zotero or Mendeley on your computer you can use a plugin to extract references from the publications you see.

Download plugins:
Zotero
Mendeley

There are no projects.
There might be more projects where Nils Anders Danielsson participates, but you have to be logged in as a Chalmers employee to see them.