Author of the publication

Non-Deterministic Abstract Machines.

, , , and . CONCUR, volume 243 of LIPIcs, page 7:1-7:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

 

Other publications of authors with the same name

Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines., and . Semantics and Algebraic Specification, volume 5700 of Lecture Notes in Computer Science, page 186-206. Springer, (2009)Fully Abstract Encodings of $łambda$-Calculus in HOcore through Abstract Machines., , , , , and . Log. Methods Comput. Sci., (2024)The Zoo of Lambda-Calculus Reduction Strategies, And Coq., , and . ITP, volume 237 of LIPIcs, page 7:1-7:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Non-Deterministic Abstract Machines., , , and . CONCUR, volume 243 of LIPIcs, page 7:1-7:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Optimizing a Non-Deterministic Abstract Machine with Environments., , , and . FSCD, volume 299 of LIPIcs, page 11:1-11:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Program Extraction From Proofs of Weak Head Normalization., , and . MFPS, volume 155 of Electronic Notes in Theoretical Computer Science, page 169-189. Elsevier, (2005)Fully abstract encodings of λ-calculus in HOcore through abstract machines., , , , , and . LICS, page 1-12. IEEE Computer Society, (2017)Generalized Refocusing: From Hybrid Strategies to Abstract Machines., , and . FSCD, volume 84 of LIPIcs, page 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)An operational foundation for the tactic language of Coq., , and . PPDP, page 25-36. ACM, (2013)A Derived Reasonable Abstract Machine for Strong Call by Value., , and . PPDP, page 6:1-6:14. ACM, (2021)