( en | de | ru )

 

Disambiguation of "Gramlich, Bernhard"

Author of the publication

copydeleteadd this publication to your clipboard
On-demand strategy annotations revisited: An improved on-demand evaluation strategy.

, , , and . Theor. Comput. Sci., 411 (2): 504-541 (2010)

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

Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems.. Fundam. Informaticae, 24 (1/2): 2-23 (1995)UNICOM: A Refined Completion Based Inductive Theorem Prover.. CADE, volume 449 of Lecture Notes in Computer Science, page 655-656. Springer, (1990)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)Characterizing and proving operational termination of deterministic conditional term rewriting systems., and . J. Log. Algebraic Methods Program., 79 (7): 659-688 (2010)On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems.. Theor. Comput. Sci., 165 (1): 97-131 (1996)Modular termination of context-sensitive rewriting., and . PPDP, page 50-61. ACM, (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)Simple Termination is Difficult., and . RTA, volume 690 of Lecture Notes in Computer Science, page 228-242. Springer, (1993)