Author of the publication

Higher-Order Interpretations and Program Complexity.

, and . CSL, volume 16 of LIPIcs, page 62-76. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)

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

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus., , and . IFIP TCS, volume 8705 of Lecture Notes in Computer Science, page 151-163. Springer, (2014)Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic., , and . CSL, volume 4207 of Lecture Notes in Computer Science, page 150-166. Springer, (2006)Timeless Games., , , and . CSL, volume 1414 of Lecture Notes in Computer Science, page 56-77. Springer, (1997)Type inference in intuitionistic linear logic., and . PPDP, page 219-230. ACM, (2010)On Quasi-Interpretations, Blind Abstractions and Implicit Complexity, , and . CoRR, (2006)Elementary Complexity and Geometry of Interaction., and . TLCA, volume 1581 of Lecture Notes in Computer Science, page 25-39. Springer, (1999)Light Logics and Optimal Reduction: Completeness and Complexity., , and . LICS, page 421-430. IEEE Computer Society, (2007)Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy.. APLAS, volume 7078 of Lecture Notes in Computer Science, page 337-352. Springer, (2011)Elementary Complexity and Geometry of Interaction., and . Fundam. Informaticae, 45 (1-2): 1-31 (2001)Soft lambda-Calculus: A Language for Polynomial Time Computation., and . FoSSaCS, volume 2987 of Lecture Notes in Computer Science, page 27-41. Springer, (2004)