Clemens Grabmayer

CoRR, 2024

2023

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2023

The Image of the Process Interpretation of Regular Expressions is Not Closed under Bisimulation Collapse.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions.

[BibT_eX]

[DOI]

Clemens Armin Grabmayer

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity.

[BibT_eX]

[DOI]

Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020

Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th International Workshop on Computing with Terms and Graphs, 2020

A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity.

[BibT_eX]

[DOI]

Wan J. Fokkink

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2018

Modeling Terms by Graphs with Structure Constraints (Two Illustrations).

[BibT_eX]

[DOI]

Proceedings of the Proceedings Tenth International Workshop on Computing with Terms and Graphs, 2018

2016

Linear Depth Increase of Lambda Terms in Leftmost-Outermost Beta-Reduction Rewrite Sequences.

[BibT_eX]

[DOI]

CoRR, 2016

2015

The Degree of Squares is an Atom (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2015

Regularity Preserving but Not Reflecting Encodings.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

The Degree of Squares is an Atom.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

Nested Term Graphs.

[BibT_eX]

[DOI]

Vincent van Oostrom

Proceedings of the Proceedings 8th International Workshop on Computing with Terms and Graphs, 2014

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Maximal sharing in the Lambda calculus with letrec.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013

Term Graph Representations for Cyclic Lambda-Terms

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th International Workshop on Computing with Terms and Graphs, 2013

Expressibility in the Lambda Calculus with Mu.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Mix-Automatic Sequences.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2013

2012

Expressibility in the Lambda Calculus with Letrec

[BibT_eX]

[DOI]

CoRR, 2012

Expressive power of digraph solvability.

[BibT_eX]

[DOI]

Marc Bezem

Michal Walicki

Ann. Pure Appl. Log., 2012

Automatic Sequences and Zip-Specifications.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

On equal μ-terms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the Termination of Russell's Description Elimination Algorithm.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2011

Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)

[BibT_eX]

[DOI]

Proceedings of the Proceedings 6th International Workshop on Computing with Terms and Graphs, 2011

2010

Productivity of stream definitions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

From Abstract Rewriting Systems to Abstract Proof Systems

[BibT_eX]

[DOI]

CoRR, 2009

Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting

[BibT_eX]

[DOI]

CoRR, 2009

Complexity of Fractran and Productivity.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2009

2008

Proving Infinitary Normalization.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, International Conference, 2008

Data-Oblivious Stream Productivity.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

2007

A duality between proof systems for cyclic term graphs.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2007

A characterization of regular expressions under bisimulation.

[BibT_eX]

[DOI]

Jos C. M. Baeten

Flavio Corradini

J. ACM, 2007

2006

Some Remarks on Definability of Process Graphs.

[BibT_eX]

[DOI]

Jan Willem Klop

Bas Luttik

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005

Reflections on a Geometry of Processes.

[BibT_eX]

[DOI]

Jan Willem Klop

Bas Luttik

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Using Proofs by Coinduction to Find "Traditional" Proofs.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2002

A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs.

[BibT_eX]

[DOI]