From post

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.

 

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

A Verified Generational Garbage Collector for CakeML., , и . J. Autom. Reason., 63 (2): 463-488 (2019)The Expressive Power of Monotonic Parallel Composition., и . ESOP, том 9632 из Lecture Notes in Computer Science, стр. 780-803. Springer, (2016)Culling Concurrency Theory : Reusable and trustworthy meta-theory, proof techniques and separation results.. Uppsala University, Sweden, (2016)base-search.net (ftuppsalauniv:oai:DiVA.org:uu-297488).Psi-Calculi Revisited: Connectivity and Compositionality.. FORTE, том 11535 из Lecture Notes in Computer Science, стр. 3-20. Springer, (2019)A Verified Generational Garbage Collector for CakeML., , и . ITP, том 10499 из Lecture Notes in Computer Science, стр. 444-461. Springer, (2017)PureCake: A Verified Compiler for a Lazy Functional Language., , , , , , и . Proc. ACM Program. Lang., 7 (PLDI): 952-976 (2023)Into the Infinite - Theory Exploration for Coinduction., , и . AISC, том 11110 из Lecture Notes in Computer Science, стр. 70-86. Springer, (2018)Bisimulation up-to techniques for psi-calculi., и . CPP, стр. 142-153. ACM, (2016)A Verified Cyclicity Checker: For Theories with Overloaded Constants., и . ITP, том 237 из LIPIcs, стр. 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Characteristic Formulae for Liveness Properties of Non-Terminating CakeML Programs., , и . ITP, том 141 из LIPIcs, стр. 32:1-32:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)