| Publication | Date of Publication | Type |
|---|
Codata in action
Programming Languages and Systems | 2023-11-24 | Paper |
Uniform strong normalization for multi-discipline calculi
Rewriting Logic and Its Applications | 2023-07-28 | Paper |
Classical (co)recursion: Mechanics
Journal of Functional Programming | 2023-07-14 | Paper |
Duality in Action (Invited Talk).
| 2023-06-23 | Paper |
Relating graph and term rewriting via Böhm models
Rewriting Techniques and Applications | 2022-12-09 | Paper |
scientific article; zbMATH DE number 7533346 (Why is no real title available?)
| 2022-05-28 | Paper |
scientific article; zbMATH DE number 7243675 (Why is no real title available?)
| 2020-09-04 | Paper |
Abstracting models of strong normalization for classical calculi
Journal of Logical and Algebraic Methods in Programming | 2020-01-31 | Paper |
The duality of classical intersection and union types
Fundamenta Informaticae | 2020-01-24 | Paper |
Call-by-name extensionality and confluence
Journal of Functional Programming | 2017-10-23 | Paper |
Sequent calculus as a compiler intermediate language
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
Structures for structural recursion
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
Compositional semantics for composable continuations: from abortive to delimited control
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming | 2016-09-29 | Paper |
A type-theoretic foundation of continuations and prompts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming | 2015-03-09 | Paper |
Delimited control and computational effects
Journal of Functional Programming | 2014-08-14 | Paper |
The Duality of Construction
Programming Languages and Systems | 2014-04-16 | Paper |
Classical call-by-need sequent calculi: the unity of semantic artifacts
Functional and Logic Programming | 2012-07-20 | Paper |
A systematic approach to delimited control with multiple prompts
Programming Languages and Systems | 2012-06-22 | Paper |
Classical call-by-need and duality
Lecture Notes in Computer Science | 2011-06-17 | Paper |
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation | 2010-05-05 | Paper |
Control reduction theories: the benefit of structural substitution
Journal of Functional Programming | 2008-05-22 | Paper |
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation | 2007-12-17 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
scientific article; zbMATH DE number 2038761 (Why is no real title available?)
| 2004-02-08 | Paper |
Bisimilarity in term graph rewriting.
Information and Computation | 2003-01-14 | Paper |
Skew confluence and the lambda calculus with letrec
Annals of Pure and Applied Logic | 2002-12-02 | Paper |
From syntactic theories to interpreters: Automating the proof of unique decomposition
Higher-Order and Symbolic Computation | 2002-06-16 | Paper |
scientific article; zbMATH DE number 1479633 (Why is no real title available?)
| 2000-07-20 | Paper |
scientific article; zbMATH DE number 1231610 (Why is no real title available?)
| 1999-01-06 | Paper |
scientific article; zbMATH DE number 1231589 (Why is no real title available?)
| 1998-12-21 | Paper |
Lambda calculus with explicit recursion
Information and Computation | 1998-07-15 | Paper |
scientific article; zbMATH DE number 1088036 (Why is no real title available?)
| 1998-04-01 | Paper |
The call-by-need lambda calculus
Journal of Functional Programming | 1997-09-29 | Paper |
Properties of a first-order functional language with sharing
Theoretical Computer Science | 1997-02-28 | Paper |
Relating graph and term rewriting via Böhm models
Applicable Algebra in Engineering, Communication and Computing | 1996-10-20 | Paper |
scientific article; zbMATH DE number 919844 (Why is no real title available?)
| 1996-08-25 | Paper |
