( en | de | ru )

 

Disambiguation of "Danielsson, Nils Anders"

Author of the publication

copydeleteadd this publication to your clipboard
PiSigma: Dependent Types without the Sugar.

, , , and . FLOPS, volume 6009 of Lecture Notes in Computer Science, page 40-55. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Eva Danielsson

Inga Danielsson

Nepomuk Felix Nilson

Kombinierte Bestimmung des immunreaktiven Trypsins und des Pankreatitis assoziierten Proteins als mögliche neue Methode des Neugeborenenscreenings auf Mukoviszidose: eine Machbarkeitsstudie. Uni Dresden, (2009)

Nils Anders Stefan Gustafsson

Andreas Nilsson

BSCCO superconductors processed by the glass ceramic route: critical aspects of process, crystallization and incorporation of oxygen, composition dependence on phase formation. TU Dresden, (2009)
 

Other publications of authors with the same name

A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized., , and . Proc. ACM Program. Lang., 7 (ICFP): 920-954 (August 2023)Operational semantics using the partiality monad.. ICFP, page 127-138. ACM, (2012)PiSigma: Dependent Types without the Sugar., , , and . FLOPS, volume 6009 of Lecture Notes in Computer Science, page 40-55. Springer, (2010)Frontmatter, Table of Contents, Preface, Workshop Organization., and . TYPES, volume 19 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Higher Inductive Type Eliminators Without Paths.. TYPES, volume 175 of LIPIcs, page 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Bag Equivalence via a Proof-Relevant Membership Relation.. ITP, volume 7406 of Lecture Notes in Computer Science, page 149-165. Springer, (2012)Beating the Productivity Checker Using Embedded Languages.. PAR@ITP, volume 5 of EPiC Series, page 34-54. EasyChair, (2010)Matroids from modules., and . MFCSIT, volume 74 of Electronic Notes in Theoretical Computer Science, page 21-38. Elsevier, (2002)Lightweight semiformal time complexity analysis for purely functional data structures.. POPL, page 133-144. ACM, (2008)Total parser combinators.. ICFP, page 285-296. ACM, (2010)