Author of the publication

Politeness for the Theory of Algebraic Datatypes.

, , , , , and . IJCAR (1), volume 12166 of Lecture Notes in Computer Science, page 238-255. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract)., , , , , and . UNIF, page 33-35. (2014)Hierarchical Combination of Matching Algorithms (Extended Abstract)., , , , and . UNIF, page 36-40. (2014)Knowledge Problems in Security Protocols: Going Beyond Subterm Convergent Theories., , , and . FSCD, volume 260 of LIPIcs, page 30:1-30:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Non-disjoint Combined Unification and Closure by Equational Paramodulation., , and . FroCoS, volume 12941 of Lecture Notes in Computer Science, page 25-42. Springer, (2021)Combining Stable Infiniteness and (Strong) Politeness., , , , , and . J. Autom. Reason., 67 (4): 34 (December 2023)Building and Combining Matching Algorithms.. Description Logic, Theory Combination, and All That, volume 11560 of Lecture Notes in Computer Science, page 523-541. Springer, (2019)Politeness and Stable Infiniteness: Stronger Together., , , , , and . CADE, volume 12699 of Lecture Notes in Computer Science, page 148-165. Springer, (2021)Timed Specification For Web Services Compatibility Analysis., , and . WWV, volume 200 of Electronic Notes in Theoretical Computer Science, page 155-170. Elsevier, (2007)Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent., , , , and . CoRR, (2024)An Open Automated Framework for Constraint Solver Extension: the SoleX Approach., and . Fundam. Informaticae, 39 (1-2): 167-187 (1999)