Publication | Date of Publication | Type |
---|
Confluence of the Chinese Monoid | 2024-03-14 | Paper |
Extended term rewriting systems | 2023-03-09 | Paper |
Termination for the direct sum of left-linear term rewriting systems | 2022-12-09 | Paper |
Transfinite reductions in orthogonal term rewriting systems | 2022-12-09 | Paper |
Open problems in rewriting | 2022-12-09 | Paper |
More problems in rewriting | 2022-12-09 | Paper |
Infinitary lambda calculi and böhm models | 2022-12-09 | Paper |
Problems in rewriting III | 2022-12-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5009706 | 2021-08-05 | Paper |
Decreasing diagrams with two labels are complete for confluence of countable systems | 2021-06-15 | Paper |
Transducer degrees: atoms, infima and suprema | 2020-05-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5109511 | 2020-05-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q5224689 | 2019-07-24 | Paper |
Braids via term rewriting | 2019-06-18 | Paper |
Term graph rewriting | 2019-01-11 | Paper |
Collapsing partial combinatory algebras | 2019-01-11 | Paper |
Degrees of Infinite Words, Polynomials and Atoms | 2018-09-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4584897 | 2018-09-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4584900 | 2018-09-04 | Paper |
Clocked lambda calculus | 2017-06-14 | Paper |
Automatic Sequences and Zip-Specifications | 2017-05-16 | Paper |
Degrees of Infinite Words, Polynomials and Atoms | 2016-08-30 | Paper |
Degrees of Transducibility | 2015-11-04 | Paper |
Reflections on a Geometry of Processes | 2015-07-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3188961 | 2014-09-09 | Paper |
Obituary: Nicolaas Govert de Bruijn (1918--2012). Mathematician, computer scientist, logician | 2014-09-03 | Paper |
De Bruijn's weak diamond property revisited | 2014-09-03 | Paper |
Discriminating Lambda-Terms Using Clocked Boehm Trees | 2014-06-10 | Paper |
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples | 2014-06-10 | Paper |
Clocks for Functional Programs | 2014-04-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q2855523 | 2013-10-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q2849584 | 2013-09-20 | Paper |
Highlights in infinitary rewriting and lambda calculus | 2013-01-07 | Paper |
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting | 2012-04-25 | Paper |
Arithmetic Self-Similarity of Infinite Sequences | 2012-01-18 | Paper |
On equal \(\mu \)-terms | 2011-07-07 | Paper |
The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) | 2011-07-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q3012528 | 2011-07-06 | Paper |
Productivity of stream definitions | 2010-02-09 | Paper |
Proving Infinitary Normalization | 2009-07-02 | Paper |
Applications of infinitary lambda calculus | 2009-06-08 | Paper |
Reduction Strategies and Acyclicity | 2009-03-06 | Paper |
Lambda calculus with patterns | 2008-06-24 | Paper |
Productivity of Stream Definitions | 2008-02-26 | Paper |
Iterative Lexicographic Path Orders | 2007-09-07 | Paper |
Some Remarks on Definability of Process Graphs | 2007-09-04 | Paper |
Computing with actions and communications | 2007-08-10 | Paper |
Bisimilarity in term graph rewriting. | 2003-01-14 | Paper |
Descendants and origins in term rewriting. | 2003-01-14 | Paper |
Linear time and branching time semantics for recursion with merge | 2002-05-13 | Paper |
A geometric proof of confluence by decreasing diagrams | 2000-09-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4490748 | 2000-07-20 | Paper |
Extending partial combinatory algebras | 1999-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4222908 | 1998-12-21 | Paper |
Diagram techniques for confluence | 1998-11-10 | Paper |
Infinitary lambda calculus | 1998-07-23 | Paper |
Lambda calculus with explicit recursion | 1998-07-15 | Paper |
Termination for direct sums of left-linear complete term rewriting systems | 1998-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4890709 | 1996-08-25 | Paper |
Comparing curried and uncurried rewriting | 1996-08-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4865611 | 1996-07-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4865612 | 1996-04-22 | Paper |
Transfinite reductions in orthogonal term rewriting systems | 1995-08-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4834480 | 1995-05-30 | Paper |
Combinatory reduction systems: Introduction and survey | 1994-09-26 | Paper |
Modularity of confluence: A simplified proof | 1994-04-04 | Paper |
Decidability of bisimulation equivalence for process generating context-free languages | 1993-12-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4038704 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4029584 | 1993-03-28 | Paper |
Sequentiality in orthogonal term rewriting systems | 1992-06-28 | Paper |
An analysis of loop checking mechanisms for logic programs | 1992-06-26 | Paper |
Unique normal forms for lambda calculus with surjective pairing | 1989-01-01 | Paper |
Term-rewriting systems with rule priorities | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4733426 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3792231 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3806800 | 1988-01-01 | Paper |
Readies and Failures in the Algebra of Communicating Processes | 1988-01-01 | Paper |
On the consistency of Koomen's fair abstraction rule | 1987-01-01 | Paper |
Needed reduction and spine strategies for the lambda calculus | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3751587 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3774929 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3805891 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3817590 | 1987-01-01 | Paper |
Conditional rewrite rules: Confluence and termination | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3028334 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3727367 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3742698 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4727412 | 1986-01-01 | Paper |
Algebra of communicating processes with abstraction | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3702500 | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5186720 | 1984-01-01 | Paper |
Proving program inclusion using Hoare's logic | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3330491 | 1984-01-01 | Paper |
Process algebra for synchronous communication | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3042376 | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3657410 | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3664413 | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3666247 | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3341873 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3674616 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3935453 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3939205 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3939218 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3951525 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3914409 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3919061 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3919062 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3919067 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3929011 | 1981-01-01 | Paper |
Invertible terms in the lambda calculus | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3918095 | 1980-01-01 | Paper |
Church-Rosser strategies in the lambda calculus | 1979-01-01 | Paper |
Degrees of sensible lambda theories | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4182476 | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4100065 | 1975-01-01 | Paper |