Nils Anders Danielsson

Associate Professor at Computing Science

Source: chalmers.se
gravatar.com image

Showing 14 publications

2025
Open Access icon

A Formalization of Opaque Definitions for a Dependent Type Theory

Nils Anders Danielsson, Eve Geng
Tyde 2025 Proceedings of the 10th ACM SIGPLAN International Workshop on Type Driven Development Co Located with ICFP Splash 2025, p. 39-51
Paper in proceeding
2023
Open Access icon

A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized

Andreas Martin Abel, Nils Anders Danielsson, Oskar Eriksson
Proceedings of the ACM on Programming Languages. Vol. 7 (ICFP), p. 920-954
Journal article
2021

Higher Lenses

Paolo Capriotti, Nils Anders Danielsson, Andrea Vezzosi
Proceedings - Symposium on Logic in Computer Science. Vol. 2021-June
Paper in proceeding
2020
Open Access icon

Practical dependent type checking using twin types

Víctor López Juan, Nils Anders Danielsson
TyDe 2020 - Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development, co-located with ICFP 2020, p. 11-23
Paper in proceeding
2017

Towards practical out-of-order unification

Nils Anders Danielsson, Víctor López Juan
Leibniz International Proceedings in Informatics, LIPIcs. Vol. 104, p. 49-50
Paper in proceeding
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 proceeding
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 proceeding
2007

Functional Program Correctness Through Types

Nils Anders Danielsson
Doctoral thesis
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 proceeding
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 proceeding

Download publication list

You can download this list to your computer.

Filter and download publication list

As logged in user (Chalmers employee) you find more export functions in MyResearch.

You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:

Zotero Connector
Mendeley Web Importer

The service SwePub offers export of contents from Research in other formats, such as Harvard and Oxford in .RIS, BibTex and RefWorks format.

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.

Feedback and support

If you have questions, need help, find a bug or just want to give us feedback you may use this form, or contact us per e-mail research.lib@chalmers.se.

About

Research.chalmers.se contains research information from Chalmers University of Technology, Sweden. It includes information on projects, publications, research funders and collaborations.

More about coverage period and what is publicly available

Privacy and cookies

Accessibility

Citation Style Language
citeproc-js (Frank Bennett)

Links

Chalmers Library
Chalmers Research
Chalmers Student Theses

Chalmers University of Technology

SE-412 96 GOTHENBURG, SWEDEN
PHONE: +46 (0)31-772 10 00
WWW.CHALMERS.SE