default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNils Anders Danielsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Andreas Abel
, Nils Anders Danielsson, Oskar Eriksson:
A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized. Proc. ACM Program. Lang. 7(ICFP): 920-954 (2023)- 2021
- [c20]Paolo Capriotti, Nils Anders Danielsson, Andrea Vezzosi:
Higher Lenses. LICS 2021: 1-13 - 2020
- [c19]Víctor López Juan, Nils Anders Danielsson:
Practical dependent type checking using twin types. TyDe@ICFP 2020: 11-23
2010 – 2019
- 2019
- [c18]Nils Anders Danielsson:
Higher Inductive Type Eliminators Without Paths. TYPES 2019: 10:1-10:18 - 2018
- [j1]Nils Anders Danielsson:
Up-to techniques using sized types. Proc. ACM Program. Lang. 2(POPL): 43:1-43:28 (2018) - 2017
- [c17]Thorsten Altenkirch, Nils Anders Danielsson, Nicolai Kraus:
Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type. FoSSaCS 2017: 534-549 - 2016
- [i1]Thorsten Altenkirch, Nils Anders Danielsson, Nicolai Kraus:
Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type. CoRR abs/1610.09254 (2016) - 2014
- [e2]Nils Anders Danielsson, Bart Jacobs:
Proceedings of the 2014 ACM SIGPLAN Workshop on Programming Languages meets Program Verification, PLPV 2014, January 21, 2014, San Diego, California, USA, Co-located with POPL '14. ACM 2014, ISBN 978-1-4503-2567-7 [contents] - 2013
- [c16]Nils Anders Danielsson:
Correct-by-construction pretty-printing. DTP@ICFP 2013: 1-12 - [e1]Nils Anders Danielsson, Bengt Nordström:
18th International Workshop on Types for Proofs and Programs, TYPES 2011, September 8-11, 2011, Bergen, Norway. LIPIcs 19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-49-1 [contents] - 2012
- [c15]Nils Anders Danielsson:
Operational semantics using the partiality monad. ICFP 2012: 127-138 - [c14]Nils Anders Danielsson:
Bag Equivalence via a Proof-Relevant Membership Relation. ITP 2012: 149-165 - 2011
- [c13]Nils Anders Danielsson, Bengt Nordström:
Frontmatter, Table of Contents, Preface, Workshop Organization. TYPES 2011 - 2010
- [c12]Thorsten Altenkirch, Nils Anders Danielsson, Andres Löh, Nicolas Oury:
PiSigma: Dependent Types without the Sugar. FLOPS 2010: 40-55 - [c11]Nils Anders Danielsson:
Total parser combinators. ICFP 2010: 285-296 - [c10]Nils Anders Danielsson:
Beating the Productivity Checker Using Embedded Languages. PAR@ITP 2010: 34-54 - [c9]Thorsten Altenkirch, Nils Anders Danielsson:
Termination Checking in the Presence of Nested Inductive and Coinductive Types. PAR@ITP 2010: 101-106 - [c8]Nils Anders Danielsson, Thorsten Altenkirch:
Subtyping, Declaratively. MPC 2010: 100-118 - [c7]Nils Anders Danielsson:
Beating the Productivity Checker Using Embedded Languages. PAR 2010: 29-48
2000 – 2009
- 2008
- [c6]Nils Anders Danielsson, Ulf Norell:
Parsing Mixfix Operators. IFL 2008: 80-99 - [c5]Nils Anders Danielsson:
Lightweight semiformal time complexity analysis for purely functional data structures. POPL 2008: 133-144 - 2007
- [b1]Nils Anders Danielsson:
Functional Program Correctness Through Types. Chalmers University of Technology, Gothenburg, Sweden, 2007 - 2006
- [c4]Nils Anders Danielsson, John Hughes, Patrik Jansson, Jeremy Gibbons:
Fast and loose reasoning is morally correct. POPL 2006: 206-217 - [c3]Nils Anders Danielsson:
A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family. TYPES 2006: 93-109 - 2004
- [c2]Nils Anders Danielsson, Patrik Jansson:
Chasing Bottoms: A Case Study in Program Verification in the Presence of Partial and Infinite Values. MPC 2004: 85-109 - 2002
- [c1]Nils Anders Danielsson, Michael B. Smyth:
Matroids from modules. MFCSIT 2002: 21-38
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
