| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7774242 (Why is no real title available?)
| 2023-12-08 | Paper |
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
Logical Methods in Computer Science | 2023-08-26 | Paper |
scientific article; zbMATH DE number 7456061 (Why is no real title available?)
| 2022-01-12 | Paper |
scientific article; zbMATH DE number 7450010 (Why is no real title available?)
| 2021-12-20 | Paper |
Nested term graphs (work in progress)
| 2021-12-02 | Paper |
Term graph representations for cyclic \(\lambda\)-terms
| 2021-05-05 | Paper |
Repetitive reduction patterns in lambda calculus with \texttt{letrec} (work in progress)
| 2021-03-03 | Paper |
A complete proof system for 1-free regular expressions modulo bisimilarity
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Linear depth increase of lambda terms in leftmost-outermost rewrite sequences
| 2019-07-24 | Paper |
Regularity preserving but not reflecting encodings
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Automatic sequences and zip-specifications
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Expressibility in the lambda calculus with \(\mu\)
| 2017-02-01 | Paper |
Maximal sharing in the lambda calculus with letrec
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming | 2016-09-29 | Paper |
The degree of squares is an atom
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Reflections on a Geometry of Processes
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Infinitary term rewriting for weakly orthogonal systems: properties and counterexamples
Logical Methods in Computer Science | 2014-06-10 | Paper |
A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs
| 2013-08-27 | Paper |
Mix-automatic sequences
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Unique normal forms in infinitary weakly orthogonal rewriting
| 2012-04-25 | Paper |
Expressive power of digraph solvability
Annals of Pure and Applied Logic | 2012-04-13 | Paper |
On the termination of Russell's description elimination algorithm
The Review of Symbolic Logic | 2011-11-14 | Paper |
On equal \(\mu \)-terms
Theoretical Computer Science | 2011-07-07 | Paper |
Productivity of stream definitions
Theoretical Computer Science | 2010-02-09 | Paper |
Complexity of Fractran and Productivity
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
Proving Infinitary Normalization
Lecture Notes in Computer Science | 2009-07-02 | Paper |
Data-Oblivious Stream Productivity
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
A characterization of regular expressions under bisimulation
Journal of the ACM | 2008-12-21 | Paper |
Productivity of Stream Definitions
Fundamentals of Computation Theory | 2008-02-26 | Paper |
A duality between proof systems for cyclic term graphs
Mathematical Structures in Computer Science | 2007-09-26 | Paper |
Some Remarks on Definability of Process Graphs
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Algebra and Coalgebra in Computer Science
Lecture Notes in Computer Science | 2006-10-20 | Paper |
