default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nils Anders Danielsson
@article{DBLP:journals/pacmpl/AbelDE23,
author = {Andreas Abel and
Nils Anders Danielsson and
Oskar Eriksson},
title = {A Graded Modal Dependent Type Theory with a Universe and Erasure,
Formalized},
journal = {Proc. {ACM} Program. Lang.},
volume = {7},
number = {{ICFP}},
pages = {920--954},
year = {2023},
url = {https://doi.org/10.1145/3607862},
doi = {10.1145/3607862},
timestamp = {Sun, 31 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pacmpl/AbelDE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/CapriottiDV21,
author = {Paolo Capriotti and
Nils Anders Danielsson and
Andrea Vezzosi},
title = {Higher Lenses},
booktitle = {36th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2021, Rome, Italy, June 29 - July 2, 2021},
pages = {1--13},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/LICS52264.2021.9470613},
doi = {10.1109/LICS52264.2021.9470613},
timestamp = {Fri, 09 Jul 2021 14:04:16 +0200},
biburl = {https://dblp.org/rec/conf/lics/CapriottiDV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfp/JuanD20,
author = {V{\'{\i}}ctor L{\'{o}}pez Juan and
Nils Anders Danielsson},
editor = {James McKinna and
Cyrus Omar},
title = {Practical dependent type checking using twin types},
booktitle = {Proceedings of the 5th {ACM} {SIGPLAN} International Workshop on Type-Driven
Development, TyDe@ICFP 2020, Virtual Event, USA, August 23, 2020},
pages = {11--23},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3406089.3409030},
doi = {10.1145/3406089.3409030},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icfp/JuanD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/types/Danielsson19,
author = {Nils Anders Danielsson},
editor = {Marc Bezem and
Assia Mahboubi},
title = {Higher Inductive Type Eliminators Without Paths},
booktitle = {25th International Conference on Types for Proofs and Programs, {TYPES}
2019, June 11-14, 2019, Oslo, Norway},
series = {LIPIcs},
volume = {175},
pages = {10:1--10:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.TYPES.2019.10},
doi = {10.4230/LIPICS.TYPES.2019.10},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/types/Danielsson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmpl/Danielsson18,
author = {Nils Anders Danielsson},
title = {Up-to techniques using sized types},
journal = {Proc. {ACM} Program. Lang.},
volume = {2},
number = {{POPL}},
pages = {43:1--43:28},
year = {2018},
url = {https://doi.org/10.1145/3158131},
doi = {10.1145/3158131},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pacmpl/Danielsson18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fossacs/AltenkirchDK17,
author = {Thorsten Altenkirch and
Nils Anders Danielsson and
Nicolai Kraus},
editor = {Javier Esparza and
Andrzej S. Murawski},
title = {Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive
Type},
booktitle = {Foundations of Software Science and Computation Structures - 20th
International Conference, {FOSSACS} 2017, Held as Part of the European
Joint Conferences on Theory and Practice of Software, {ETAPS} 2017,
Uppsala, Sweden, April 22-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10203},
pages = {534--549},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-54458-7\_31},
doi = {10.1007/978-3-662-54458-7\_31},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fossacs/AltenkirchDK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AltenkirchDK16,
author = {Thorsten Altenkirch and
Nils Anders Danielsson and
Nicolai Kraus},
title = {Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive
Type},
journal = {CoRR},
volume = {abs/1610.09254},
year = {2016},
url = {http://arxiv.org/abs/1610.09254},
eprinttype = {arXiv},
eprint = {1610.09254},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AltenkirchDK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/plpv/2014,
editor = {Nils Anders Danielsson and
Bart Jacobs},
title = {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},
publisher = {{ACM}},
year = {2014},
url = {http://dl.acm.org/citation.cfm?id=2541568},
isbn = {978-1-4503-2567-7},
timestamp = {Thu, 09 Jan 2014 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/plpv/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfp/Danielsson13,
author = {Nils Anders Danielsson},
editor = {Stephanie Weirich},
title = {Correct-by-construction pretty-printing},
booktitle = {Proceedings of the 2013 {ACM} {SIGPLAN} workshop on Dependently-typed
programming, DTP@ICFP 2013, Boston, Massachusetts, USA, September
24, 2013},
pages = {1--12},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2502409.2502410},
doi = {10.1145/2502409.2502410},
timestamp = {Tue, 06 Nov 2018 16:59:25 +0100},
biburl = {https://dblp.org/rec/conf/icfp/Danielsson13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/types/2011,
editor = {Nils Anders Danielsson and
Bengt Nordstr{\"{o}}m},
title = {18th International Workshop on Types for Proofs and Programs, {TYPES}
2011, September 8-11, 2011, Bergen, Norway},
series = {LIPIcs},
volume = {19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=13001},
isbn = {978-3-939897-49-1},
timestamp = {Wed, 21 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/types/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfp/Danielsson12,
author = {Nils Anders Danielsson},
editor = {Peter Thiemann and
Robby Bruce Findler},
title = {Operational semantics using the partiality monad},
booktitle = {{ACM} {SIGPLAN} International Conference on Functional Programming,
ICFP'12, Copenhagen, Denmark, September 9-15, 2012},
pages = {127--138},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2364527.2364546},
doi = {10.1145/2364527.2364546},
timestamp = {Thu, 24 Jun 2021 16:19:30 +0200},
biburl = {https://dblp.org/rec/conf/icfp/Danielsson12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itp/Danielsson12,
author = {Nils Anders Danielsson},
editor = {Lennart Beringer and
Amy P. Felty},
title = {Bag Equivalence via a Proof-Relevant Membership Relation},
booktitle = {Interactive Theorem Proving - Third International Conference, {ITP}
2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7406},
pages = {149--165},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32347-8\_11},
doi = {10.1007/978-3-642-32347-8\_11},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/itp/Danielsson12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/types/DanielssonN11,
author = {Nils Anders Danielsson and
Bengt Nordstr{\"{o}}m},
editor = {Nils Anders Danielsson and
Bengt Nordstr{\"{o}}m},
title = {Frontmatter, Table of Contents, Preface, Workshop Organization},
booktitle = {18th International Workshop on Types for Proofs and Programs, {TYPES}
2011, September 8-11, 2011, Bergen, Norway},
series = {LIPIcs},
volume = {19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.TYPES.2011.i},
doi = {10.4230/LIPICS.TYPES.2011.I},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/types/DanielssonN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/flops/AltenkirchDLO10,
author = {Thorsten Altenkirch and
Nils Anders Danielsson and
Andres L{\"{o}}h and
Nicolas Oury},
editor = {Matthias Blume and
Naoki Kobayashi and
Germ{\'{a}}n Vidal},
title = {PiSigma: Dependent Types without the Sugar},
booktitle = {Functional and Logic Programming, 10th International Symposium, {FLOPS}
2010, Sendai, Japan, April 19-21, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6009},
pages = {40--55},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12251-4\_5},
doi = {10.1007/978-3-642-12251-4\_5},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/flops/AltenkirchDLO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfp/Danielsson10,
author = {Nils Anders Danielsson},
editor = {Paul Hudak and
Stephanie Weirich},
title = {Total parser combinators},
booktitle = {Proceeding of the 15th {ACM} {SIGPLAN} international conference on
Functional programming, {ICFP} 2010, Baltimore, Maryland, USA, September
27-29, 2010},
pages = {285--296},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1863543.1863585},
doi = {10.1145/1863543.1863585},
timestamp = {Tue, 22 Jun 2021 17:10:56 +0200},
biburl = {https://dblp.org/rec/conf/icfp/Danielsson10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itp/Danielsson10,
author = {Nils Anders Danielsson},
editor = {Ekaterina Komendantskaya and
Ana Bove and
Milad Niqui},
title = {Beating the Productivity Checker Using Embedded Languages},
booktitle = {Partiality and Recursion in Interactive Theorem Provers, PAR@ITP 2010,
Edinburgh, UK, July 15, 2010},
series = {EPiC Series},
volume = {5},
pages = {34--54},
publisher = {EasyChair},
year = {2010},
url = {https://doi.org/10.29007/l41f},
doi = {10.29007/L41F},
timestamp = {Sun, 15 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/itp/Danielsson10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itp/AltenkirchD10,
author = {Thorsten Altenkirch and
Nils Anders Danielsson},
editor = {Ekaterina Komendantskaya and
Ana Bove and
Milad Niqui},
title = {Termination Checking in the Presence of Nested Inductive and Coinductive
Types},
booktitle = {Partiality and Recursion in Interactive Theorem Provers, PAR@ITP 2010,
Edinburgh, UK, July 15, 2010},
series = {EPiC Series},
volume = {5},
pages = {101--106},
publisher = {EasyChair},
year = {2010},
url = {https://doi.org/10.29007/n51d},
doi = {10.29007/N51D},
timestamp = {Sun, 15 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/itp/AltenkirchD10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mpc/DanielssonA10,
author = {Nils Anders Danielsson and
Thorsten Altenkirch},
editor = {Claude Bolduc and
Jos{\'{e}}e Desharnais and
B{\'{e}}chir Ktari},
title = {Subtyping, Declaratively},
booktitle = {Mathematics of Program Construction, 10th International Conference,
{MPC} 2010, Qu{\'{e}}bec City, Canada, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6120},
pages = {100--118},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13321-3\_8},
doi = {10.1007/978-3-642-13321-3\_8},
timestamp = {Sat, 16 Oct 2021 20:00:44 +0200},
biburl = {https://dblp.org/rec/conf/mpc/DanielssonA10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-1012-4898,
author = {Nils Anders Danielsson},
editor = {Ana Bove and
Ekaterina Komendantskaya and
Milad Niqui},
title = {Beating the Productivity Checker Using Embedded Languages},
booktitle = {Proceedings Workshop on Partiality and Recursion in Interactive Theorem
Provers, {PAR} 2010, Edinburgh, UK, 15th July 2010},
series = {{EPTCS}},
volume = {43},
pages = {29--48},
year = {2010},
url = {https://doi.org/10.4204/EPTCS.43.3},
doi = {10.4204/EPTCS.43.3},
timestamp = {Thu, 14 Oct 2021 09:14:41 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-4898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifl/DanielssonN08,
author = {Nils Anders Danielsson and
Ulf Norell},
editor = {Sven{-}Bodo Scholz and
Olaf Chitil},
title = {Parsing Mixfix Operators},
booktitle = {Implementation and Application of Functional Languages - 20th International
Symposium, {IFL} 2008, Hatfield, UK, September 10-12, 2008. Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5836},
pages = {80--99},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-24452-0\_5},
doi = {10.1007/978-3-642-24452-0\_5},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/ifl/DanielssonN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/Danielsson08,
author = {Nils Anders Danielsson},
editor = {George C. Necula and
Philip Wadler},
title = {Lightweight semiformal time complexity analysis for purely functional
data structures},
booktitle = {Proceedings of the 35th {ACM} {SIGPLAN-SIGACT} Symposium on Principles
of Programming Languages, {POPL} 2008, San Francisco, California,
USA, January 7-12, 2008},
pages = {133--144},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1328438.1328457},
doi = {10.1145/1328438.1328457},
timestamp = {Fri, 25 Jun 2021 14:48:54 +0200},
biburl = {https://dblp.org/rec/conf/popl/Danielsson08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Danielsson07,
author = {Nils Anders Danielsson},
title = {Functional Program Correctness Through Types},
school = {Chalmers University of Technology, Gothenburg, Sweden},
year = {2007},
url = {http://publications.lib.chalmers.se/publication/61161-functional-program-correctness-through-types},
timestamp = {Thu, 23 Mar 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/basesearch/Danielsson07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/DanielssonHJG06,
author = {Nils Anders Danielsson and
John Hughes and
Patrik Jansson and
Jeremy Gibbons},
editor = {J. Gregory Morrisett and
Simon L. Peyton Jones},
title = {Fast and loose reasoning is morally correct},
booktitle = {Proceedings of the 33rd {ACM} {SIGPLAN-SIGACT} Symposium on Principles
of Programming Languages, {POPL} 2006, Charleston, South Carolina,
USA, January 11-13, 2006},
pages = {206--217},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1111037.1111056},
doi = {10.1145/1111037.1111056},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/popl/DanielssonHJG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/types/Danielsson06,
author = {Nils Anders Danielsson},
editor = {Thorsten Altenkirch and
Conor McBride},
title = {A Formalisation of a Dependently Typed Language as an Inductive-Recursive
Family},
booktitle = {Types for Proofs and Programs, International Workshop, {TYPES} 2006,
Nottingham, UK, April 18-21, 2006, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4502},
pages = {93--109},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-74464-1\_7},
doi = {10.1007/978-3-540-74464-1\_7},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/types/Danielsson06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mpc/DanielssonJ04,
author = {Nils Anders Danielsson and
Patrik Jansson},
editor = {Dexter Kozen and
Carron Shankland},
title = {Chasing Bottoms: {A} Case Study in Program Verification in the Presence
of Partial and Infinite Values},
booktitle = {Mathematics of Program Construction, 7th International Conference,
{MPC} 2004, Stirling, Scotland, UK, July 12-14, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3125},
pages = {85--109},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27764-4\_6},
doi = {10.1007/978-3-540-27764-4\_6},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/mpc/DanielssonJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/DanielssonS02,
author = {Nils Anders Danielsson and
Michael B. Smyth},
editor = {Sharon Flynn and
Ted Hurley and
M{\'{\i}}che{\'{a}}l Mac an Airchinnigh and
Niall Madden and
Michael McGettrick and
Michel P. Schellekens and
Anthony Karel Seda},
title = {Matroids from modules},
booktitle = {Second Irish Conference on the Mathematical Foundations of Computer
Science and Information Technology, {MFCSIT} 2002, Galway, Ireland,
July 18-19, 2002},
series = {Electronic Notes in Theoretical Computer Science},
volume = {74},
pages = {21--38},
publisher = {Elsevier},
year = {2002},
url = {https://doi.org/10.1016/S1571-0661(04)80763-1},
doi = {10.1016/S1571-0661(04)80763-1},
timestamp = {Wed, 07 Dec 2022 08:54:15 +0100},
biburl = {https://dblp.org/rec/journals/entcs/DanielssonS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-22 20:52 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:
