Nils Anders Danielsson

According to our database1, Nils Anders Danielsson authored at least 20 papers between 2002 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Practical dependent type checking using twin types.
Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development, 2020

2019
Higher Inductive Type Eliminators Without Paths.
Proceedings of the 25th International Conference on Types for Proofs and Programs, 2019

2018
Up-to techniques using sized types.
Proc. ACM Program. Lang., 2018

2017
Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2013
Correct-by-construction pretty-printing.
Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming, 2013

2012
Bag Equivalence via a Proof-Relevant Membership Relation.
Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

Operational semantics using the partiality monad.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Frontmatter, Table of Contents, Preface, Workshop Organization.
Proceedings of the 18th International Workshop on Types for Proofs and Programs, 2011

2010
Beating the Productivity Checker Using Embedded Languages
Proceedings of the Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers, 2010

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

Termination Checking in the Presence of Nested Inductive and Coinductive Types.
Proceedings of the Partiality and Recursion in Interactive Theorem Provers, 2010

Total parser combinators.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

PiSigma: Dependent Types without the Sugar.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2008
Lightweight semiformal time complexity analysis for purely functional data structures.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Parsing Mixfix Operators.
Proceedings of the Implementation and Application of Functional Languages, 2008

2007
Functional Program Correctness Through Types.
PhD thesis, 2007

2006
A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family.
Proceedings of the Types for Proofs and Programs, International Workshop, 2006

Fast and loose reasoning is morally correct.
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.
Proceedings of the Mathematics of Program Construction, 7th International Conference, 2004

2002
Matroids from modules.
Electron. Notes Theor. Comput. Sci., 2002


  Loading...