default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClemens Grabmayer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j8]Clemens Grabmayer:
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity. Log. Methods Comput. Sci. 19(2) (2023)- 2014
- [j7]Jörg Endrullis
, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom:
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. Log. Methods Comput. Sci. 10(2) (2014) - 2012
- [j6]Marc Bezem, Clemens Grabmayer, Michal Walicki:
Expressive power of digraph solvability. Ann. Pure Appl. Log. 163(3): 200-213 (2012) - 2011
- [j5]Clemens Grabmayer, Joop Leo, Vincent van Oostrom, Albert Visser:
On the Termination of Russell's Description Elimination Algorithm. Rev. Symb. Log. 4(3): 367-393 (2011) - [j4]Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom:
On equal μ-terms. Theor. Comput. Sci. 412(28): 3175-3202 (2011) - 2010
- [j3]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of stream definitions. Theor. Comput. Sci. 411(4-5): 765-782 (2010) - 2007
- [j2]Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer:
A characterization of regular expressions under bisimulation. J. ACM 54(2): 6 (2007) - [j1]Clemens Grabmayer:
A duality between proof systems for cyclic term graphs. Math. Struct. Comput. Sci. 17(3): 439-484 (2007)
Conference and Workshop Papers
- 2022
- [c23]Clemens Armin Grabmayer:
Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions. LICS 2022: 34:1-34:13 - 2021
- [c22]Clemens Grabmayer:
A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity. CALCO 2021: 16:1-16:23 - 2020
- [c21]Clemens Grabmayer, Wan J. Fokkink:
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity. LICS 2020: 465-478 - [c20]Clemens Grabmayer:
Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions. TERMGRAPH@FSCD 2020: 29-45 - 2018
- [c19]Clemens Grabmayer:
Modeling Terms by Graphs with Structure Constraints (Two Illustrations). TERMGRAPH@FSCD 2018: 1-13 - 2015
- [c18]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema:
The Degree of Squares is an Atom. WORDS 2015: 109-121 - [c17]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Regularity Preserving but Not Reflecting Encodings. LICS 2015: 535-546 - 2014
- [c16]Clemens Grabmayer, Jan Rochel:
Maximal sharing in the Lambda calculus with letrec. ICFP 2014: 67-80 - [c15]Clemens Grabmayer, Vincent van Oostrom:
Nested Term Graphs. TERMGRAPH 2014: 48-65 - 2013
- [c14]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Mix-Automatic Sequences. LATA 2013: 262-274 - [c13]Clemens Grabmayer, Jan Rochel:
Expressibility in the Lambda Calculus with Mu. RTA 2013: 206-222 - [c12]Clemens Grabmayer, Jan Rochel:
Term Graph Representations for Cyclic Lambda-Terms. TERMGRAPH 2013: 56-73 - 2012
- [c11]Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss:
Automatic Sequences and Zip-Specifications. LICS 2012: 335-344 - 2011
- [c10]Jan Rochel, Clemens Grabmayer:
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress). TERMGRAPH 2011: 85-100 - 2010
- [c9]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom:
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. RTA 2010: 85-102 - 2009
- [c8]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Complexity of Fractran and Productivity. CADE 2009: 371-387 - 2008
- [c7]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Data-Oblivious Stream Productivity. LPAR 2008: 79-96 - [c6]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer:
Proving Infinitary Normalization. TYPES 2008: 64-82 - 2007
- [c5]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of Stream Definitions. FCT 2007: 274-287 - 2006
- [c4]Clemens Grabmayer, Jan Willem Klop, Bas Luttik:
Some Remarks on Definability of Process Graphs. CONCUR 2006: 16-36 - 2005
- [c3]Clemens Grabmayer:
Using Proofs by Coinduction to Find "Traditional" Proofs. CALCO 2005: 175-193 - [c2]Clemens Grabmayer, Jan Willem Klop, Bas Luttik:
Reflections on a Geometry of Processes. APC 25 2005: 183-190 - 2002
- [c1]Clemens Grabmayer:
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs. TERMGRAPH 2002: 59-74
Editorship
- 2023
- [e1]Clemens Grabmayer:
Proceedings Twelfth International Workshop on Computing with Terms and Graphs, TERMGRAPH@FSCD 2022, Technion, Haifa, Israel, 1st August 2022. EPTCS 377, 2023 [contents]
Informal and Other Publications
- 2024
- [i19]Clemens Grabmayer:
From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes. CoRR abs/2410.00538 (2024) - 2023
- [i18]Clemens Grabmayer:
The Image of the Process Interpretation of Regular Expressions is Not Closed under Bisimulation Collapse. CoRR abs/2303.08553 (2023) - 2022
- [i17]Clemens Grabmayer:
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity. CoRR abs/2203.09501 (2022) - [i16]Clemens Grabmayer:
Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete (Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions). CoRR abs/2209.12188 (2022) - 2021
- [i15]Clemens Grabmayer:
A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity. CoRR abs/2108.13104 (2021) - 2020
- [i14]Clemens Grabmayer, Wan J. Fokkink:
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity. CoRR abs/2004.12740 (2020) - [i13]Clemens Grabmayer:
Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions. CoRR abs/2012.10869 (2020) - 2016
- [i12]Clemens Grabmayer:
Linear Depth Increase of Lambda Terms in Leftmost-Outermost Beta-Reduction Rewrite Sequences. CoRR abs/1604.07030 (2016) - 2015
- [i11]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Regularity Preserving but not Reflecting Encodings. CoRR abs/1501.04835 (2015) - [i10]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema:
The Degree of Squares is an Atom (Extended Version). CoRR abs/1506.00884 (2015) - 2014
- [i9]Clemens Grabmayer, Jan Rochel:
Maximal Sharing in the Lambda Calculus with letrec. CoRR abs/1401.1460 (2014) - 2013
- [i8]Clemens Grabmayer, Jan Rochel:
Expressibility in the Lambda Calculus with mu. CoRR abs/1304.6284 (2013) - [i7]Clemens Grabmayer, Jan Rochel:
Term Graph Representations for Cyclic Lambda-Terms. CoRR abs/1308.1034 (2013) - 2012
- [i6]Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss:
Automatic Sequences and Zip-Specifications. CoRR abs/1201.3251 (2012) - [i5]Clemens Grabmayer, Jan Rochel:
Expressibility in the Lambda Calculus with Letrec. CoRR abs/1208.2383 (2012) - 2009
- [i4]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Complexity of Fractran and Productivity. CoRR abs/0903.4366 (2009) - [i3]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop:
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting. CoRR abs/0911.1009 (2009) - [i2]Clemens Grabmayer:
From Abstract Rewriting Systems to Abstract Proof Systems. CoRR abs/0911.1412 (2009) - 2008
- [i1]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Data-Oblivious Stream Productivity. CoRR abs/0806.2680 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
