| Publication | Date of Publication | Type |
|---|
| Infinitary refinement types for temporal properties in Scott domains | 2026-01-13 | Paper |
| Temporal refinements for guarded recursive types | 2021-10-18 | Paper |
LMSO: a Curry-Howard approach to Church's synthesis via linear logic
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| A functional (monadic) second-order theory of infinite trees | 2020-11-03 | Paper |
A functional (monadic) second-order theory of infinite trees
(available as arXiv preprint) | 2020-11-03 | Paper |
| scientific article; zbMATH DE number 7204449 (Why is no real title available?) | 2020-05-26 | Paper |
Monoidal-closed categories of tree automata
Mathematical Structures in Computer Science | 2020-03-11 | Paper |
| A Dialectica-like interpretation of a linear MSO on infinite words | 2020-01-28 | Paper |
scientific article; zbMATH DE number 7147442 (Why is no real title available?)
(available as arXiv preprint) | 2020-01-03 | Paper |
A complete axiomatization of MSO on infinite trees
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Fibrations of tree automata | 2017-07-12 | Paper |
Forcing MSO on infinite words in weak MSO
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
On bar recursion and choice in a classical setting
Programming Languages and Systems | 2015-01-12 | Paper |
A model theoretic proof of completeness of an axiomatization of monadic second-order logic on infinite words
Lecture Notes in Computer Science | 2012-09-21 | Paper |
On the confluence of lambda-calculus with conditional rewriting
Theoretical Computer Science | 2010-08-24 | Paper |
A Tutorial on Type-Based Termination
Language Engineering and Rigorous Software Development | 2009-07-28 | Paper |
On the Values of Reducibility Candidates
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Type-Based Termination with Sized Products
Computer Science Logic | 2008-11-20 | Paper |
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
On the Stability by Union of Reducibility Candidates
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Computer application to aid the unidirectional functional dimensioning and tolerancing synthesis
Engineering Computations | 2005-10-28 | Paper |
