- Hem
- Om universitetet
- Hitta person
- Nils Anders Danielsson
Nils Anders Danielsson
Universitetslektor
Logik och typer (LT) - IT-
A Graded Modal Dependent Type Theory with a Universe and Erasure,
Formalized
Andreas Abel, Nils Anders Danielsson, Oskar Eriksson
Proceedings of the ACM on Programming Languages - 2023 -
Higher
Lenses
Paolo Capriotti, Nils Anders Danielsson, Andrea Vezzosi
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - 2021 -
Practical Dependent Type Checking using Twin
Types
Víctor López Juan, Nils Anders Danielsson
TyDe '20, Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development - 2020 -
Higher Inductive Type Eliminators Without
Paths
Nils Anders Danielsson
25th International Conference on Types for Proofs and Programs - 2020 -
Up-to Techniques using Sized
Types
Nils Anders Danielsson
Proceedings of the ACM on Programming Languages - 2018 -
Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive
Type
Thorsten Altenkirch, Nils Anders Danielsson, Nicolai Kraus
Foundations of Software Science and Computation Structures, 20th International Conference, FOSSACS 2017 - 2017 -
Type Theory with Weak
J
Thorsten Altenkirch, Paolo Capriotti, Thierry Coquand, Nils Anders Danielsson, Simon Huber, Nicolai Kraus
23rd International Conference on Types for Proofs and Programs, TYPES 2017, Budapest, Hungary, 29 May - 1 June 2017, Abstracts - 2017 -
Towards practical out-of-order
unification
Nils Anders Danielsson, Vı́ctor López Juan
23rd International Conference on Types for Proofs and Programs, TYPES 2017, Budapest, Hungary, 29 May - 1 June 2017, Abstracts - 2017 -
Partiality,
Revisited
Thorsten Altenkirch, Nils Anders Danielsson
TYPES 2016, Types for Proofs and Programs, 22nd Meeting, Novi Sad, Serbia, 23 – 26 May, 2016, Book of Abstracts - 2016 -
Correct-by-Construction
Pretty-Printing
Nils Anders Danielsson
Proceedings of the 2013 ACM SIGPLAN Workshop on Dependently-Typed Programming (DTP 2013) - 2013 -
Isomorphism is
equality
Thierry Coquand, Nils Anders Danielsson
Indagationes mathematicae - 2013 -
Operational Semantics Using the Partiality
Monad
Nils Anders Danielsson
SIGPLAN notices - 2012 -
Operational Semantics Using the Partiality
Monad
Nils Anders Danielsson
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (ICFP 2012) - 2012 -
Bag Equivalence via a Proof-Relevant Membership
Relation
Nils Anders Danielsson
Interactive Theorem Proving, Third International Conference, ITP 2012 - 2012 -
Lightweight Semiformal Time Complexity Analysis for Purely Functional Data
Structures
Nils Anders Danielsson
Conference record of the 35th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2008) - 2008 -
Functional Program Correctness Through
Types
-
Proofs Accompanying "Fast and Loose Reasoning is Morally
Correct"
-
A Formalisation of the Correctness Result From "Lightweight Semiformal Time Complexity Analysis for Purely Functional Data
Structures"
-
A Formalisation of a Dependently Typed Language as an Inductive-Recursive
Family
Nils Anders Danielsson
Thorsten Altenkirch and Conor McBride (Eds.): Types for Proofs and Programs, International Workshop, TYPES 2006, Nottingham, UK, April 2006, Revised Selected Papers - 2007 -
Fast and Loose Reasoning is Morally
Correct
Nils Anders Danielsson, John Hughes, Patrik Jansson, Jeremy Gibbons
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2006) - 2006 -
Precise Reasoning About Non-strict Functional Programs; How to Chase Bottoms, and How to Ignore
Them
-
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 - 2004