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

Fast and Simple Methods For Computing Control Points, and . CoRR, (2006)Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches. CoRR, (2006)Rigid E-Unification is NP-Complete, , , and . LICS, page 218-227. IEEE Computer Society, (1988)Logic for Computer Science: Foundations of Automatic Theorem Proving.. Wiley, (1987)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)n-Rational Algebras I. Basic Properties and Free Algebras.. SIAM J. Comput., 13 (4): 750-775 (1984)Solving Word Problems in Free Algebras Using Complexity Functions., and . CADE, volume 170 of Lecture Notes in Computer Science, page 476-495. Springer, (1984)Typing Untyped lambda-Terms, or Reducibility Strikes Again!. Ann. Pure Appl. Log., 91 (2-3): 231-270 (1998)Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi.. Theor. Comput. Sci., 110 (2): 249-339 (1993)Constrained quadrilateral meshes of bounded size., , , , and . Int. J. Comput. Geom. Appl., 15 (1): 55-98 (2005)