Author of the publication

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming.

, and . ESOP, volume 5502 of Lecture Notes in Computer Science, page 47-61. Springer, (2009)

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

Bisimulation and Co-induction (Tutorial). LICS, page 2-3. (1993)Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?, and . MFCS, volume 711 of Lecture Notes in Computer Science, page 122-141. Springer, (1993)Encoding Abstract Syntax Without Fresh Names., and . J. Autom. Reason., 49 (2): 115-140 (2012)Process Calculus Based Upon Evaluation to Committed Form., and . Theor. Comput. Sci., 195 (2): 155-182 (1998)Locally Nameless Sets.. Proc. ACM Program. Lang., 7 (POPL): 488-514 (January 2023)Nominal Unificaiton., , and . CSL, volume 2803 of Lecture Notes in Computer Science, page 513-527. Springer, (2003)Decomposing the Univalence Axiom., and . TYPES, volume 104 of LIPIcs, page 6:1-6:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Nominal Presentation of Cubical Sets Models of Type Theory.. TYPES, volume 39 of LIPIcs, page 202-220. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Models of Type Theory Based on Moore Paths., and . CoRR, (2018)New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic, and . Inf. Comput., 98 (2): 171-210 (June 1992)