Author of the publication

Polymorphic Rewriting Conserves Algebraic Strong Normalization.

, and . Theor. Comput. Sci., 83 (1): 3-28 (1991)

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

Solving Word Problems in Free Algebras Using Complexity Functions., and . CADE, volume 170 of Lecture Notes in Computer Science, page 476-495. Springer, (1984)Exact Computation Sequences., and . CAAP, volume 214 of Lecture Notes in Computer Science, page 45-59. Springer, (1986)Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches. CoRR, (2006)Fast and Simple Methods For Computing Control Points, and . CoRR, (2006)An Efficient Evaluator for Attribute Grammars with Conditional Rules. Technical Report, Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, Philadelphia, PA, (October 1983)Logic for Computer Science: Foundations of Automatic Theorem Proving.. Wiley, (1987)Rigid E-Unification is NP-Complete, , , and . LICS, page 218-227. IEEE Computer Society, (1988)Typing Untyped lambda-Terms, or Reducibility Strikes Again!. Ann. Pure Appl. Log., 91 (2-3): 231-270 (1998)Complete Sets of Transformations for General E-Unification., and . Theor. Comput. Sci., 67 (2&3): 203-260 (1989)Tree Pushdown Automata., and . J. Comput. Syst. Sci., 30 (1): 25-40 (1985)