 | 2010 |
| 10 |  | Thorsten Altenkirch,
Nils Anders Danielsson,
Andres Löh,
Nicolas Oury:
PiSigma: Dependent Types without the Sugar.
FLOPS 2010: 40-55 |
| 9 |  | Nils Anders Danielsson:
Total parser combinators.
ICFP 2010: 285-296 |
| 8 |  | Nils Anders Danielsson,
Thorsten Altenkirch:
Subtyping, Declaratively.
MPC 2010: 100-118 |
| 7 |  | Nils Anders Danielsson:
Beating the Productivity Checker Using Embedded Languages
PAR 2010: 29-48 |
| 2008 |
| 6 |  | Nils Anders Danielsson,
Ulf Norell:
Parsing Mixfix Operators.
IFL 2008: 80-99 |
| 5 |  | Nils Anders Danielsson:
Lightweight semiformal time complexity analysis for purely functional data structures.
POPL 2008: 133-144 |
| 2006 |
| 4 |  | Nils Anders Danielsson,
John Hughes,
Patrik Jansson,
Jeremy Gibbons:
Fast and loose reasoning is morally correct.
POPL 2006: 206-217 |
| 3 |  | Nils Anders Danielsson:
A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family.
TYPES 2006: 93-109 |
| 2004 |
| 2 |  | 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 |
| 1 |  | Nils Anders Danielsson,
Michael B. Smyth:
Matroids from modules.
Electr. Notes Theor. Comput. Sci. 74: 21-38 (2002) |