( en | de | ru )

 

Disambiguation of "Gramlich, Bernhard"

Author of the publication

copydeleteadd this publication to your clipboard
Improving On-Demand Strategy Annotations.

, , , and . LPAR, volume 2514 of Lecture Notes in Computer Science, page 1-18. Springer, (2002)

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.

Bernhard Gramlich

Horst Gramlich

Rainer Gramlich

Bernd Gramlich

Bernd Gramlich

 

Other publications of authors with the same name

Simple Termination is Difficult., and . RTA, volume 690 of Lecture Notes in Computer Science, page 228-242. Springer, (1993)On Proving Termination by Innermost Termination.. RTA, volume 1103 of Lecture Notes in Computer Science, page 93-107. Springer, (1996)Modular termination of context-sensitive rewriting., and . PPDP, page 50-61. ACM, (2002)Improving On-Demand Strategy Annotations., , , and . LPAR, volume 2514 of Lecture Notes in Computer Science, page 1-18. Springer, (2002)On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems., , and . RTA, volume 15 of LIPIcs, page 193-208. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)On (Un)Soundness of Unravelings., , and . RTA, volume 6 of LIPIcs, page 119-134. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems.. ALP, volume 850 of Lecture Notes in Computer Science, page 186-203. Springer, (1994)On interreduction of semi-complete term rewriting systems.. Theor. Comput. Sci., 258 (1-2): 435-451 (2001)Generalized Sufficient Conditions for Modular Termination of Rewriting.. ALP, volume 632 of Lecture Notes in Computer Science, page 53-68. Springer, (1992)Realizing Monads in Interaction Nets via Generic Typed Rules., and . TAMC, volume 7287 of Lecture Notes in Computer Science, page 509-524. Springer, (2012)