( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized.

, , и . Proc. ACM Program. Lang., 7 (ICFP): 920-954 (августа 2023)

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.

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)
 

Другие публикации лиц с тем же именем

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