Nils Anders Danielsson

According to our database, Nils Anders Danielsson authored at least 22 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

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

Andreas Abel, Nils Anders Danielsson, Oskar Eriksson

Proc. ACM Program. Lang., August, 2023

2021

Higher Lenses.

Paolo Capriotti, Nils Anders Danielsson, Andrea Vezzosi

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Practical dependent type checking using twin types.

Víctor López Juan, Nils Anders Danielsson

Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development, 2020

2019

Higher Inductive Type Eliminators Without Paths.

Nils Anders Danielsson

Proceedings of the 25th International Conference on Types for Proofs and Programs, 2019

2018

Up-to techniques using sized types.

Nils Anders Danielsson

Proc. ACM Program. Lang., 2018

2017

Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type.

Thorsten Altenkirch, Nils Anders Danielsson, Nicolai Kraus

Proceedings of the Foundations of Software Science and Computation Structures, 2017

2013

Correct-by-construction pretty-printing.

Nils Anders Danielsson

Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming, 2013

2012

Bag Equivalence via a Proof-Relevant Membership Relation.

Nils Anders Danielsson

Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

Operational semantics using the partiality monad.

Nils Anders Danielsson

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011

Frontmatter, Table of Contents, Preface, Workshop Organization.

Nils Anders Danielsson, Bengt Nordström

Proceedings of the 18th International Workshop on Types for Proofs and Programs, 2011

2010

Beating the Productivity Checker Using Embedded Languages

Nils Anders Danielsson

Proceedings of the Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers, 2010

Subtyping, Declaratively.

Nils Anders Danielsson, Thorsten Altenkirch

Proceedings of the Mathematics of Program Construction, 10th International Conference, 2010

Termination Checking in the Presence of Nested Inductive and Coinductive Types.

Thorsten Altenkirch, Nils Anders Danielsson

Proceedings of the Partiality and Recursion in Interactive Theorem Provers, 2010

Total parser combinators.

Nils Anders Danielsson

Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

PiSigma: Dependent Types without the Sugar.

Thorsten Altenkirch, Nils Anders Danielsson, Andres Löh, Nicolas Oury

Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2008

Lightweight semiformal time complexity analysis for purely functional data structures.

Nils Anders Danielsson

Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Parsing Mixfix Operators.

Nils Anders Danielsson, Ulf Norell

Proceedings of the Implementation and Application of Functional Languages, 2008

2007

Functional Program Correctness Through Types.

Nils Anders Danielsson

PhD thesis, 2007

2006

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

Nils Anders Danielsson

Proceedings of the Types for Proofs and Programs, International Workshop, 2006

Fast and loose reasoning is morally correct.

Nils Anders Danielsson, John Hughes, Patrik Jansson, Jeremy Gibbons

Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

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 Mathematics of Program Construction, 7th International Conference, 2004

2002

Matroids from modules.

Nils Anders Danielsson, Michael B. Smyth

Proceedings of the Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2002