PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Schmidt-Schauß, Manfred"

Author of the publication

copydeleteadd this publication to your clipboard
Natural Expert: A Commercial Functional Programming Environment.

, , , and . J. Funct. Program., 7 (2): 163-182 (1997)

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.

Manfred Bischoff

Simon Schmidt University of Stuttgart

Dr. Dietmar Schmidt University of Stuttgart

Carlo Schmidt University of Stuttgart

Univ. -Prof. Dr. -Ing. Manfred Bischoff University of Stuttgart

 

Other publications of authors with the same name

Bericht zur 9th Conference on Automated Deduction., and . KI, 2 (4): 18-19 (1988)Unification in Boolean Rings and Abelian Groups., , and . J. Symb. Comput., 8 (5): 449-477 (1989)An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages., and . WPTE@FSCD, volume 235 of EPTCS, page 78-92. (2016)Computational Aspects of an Order-Sorted Logic with Term Declarations. Lecture Notes in Computer Science Springer, (1989)Unification in Free Extensions of Boolean Rings and Abelian Groups, , and . LICS, page 121-130. IEEE Computer Society, (1988)Abstract Reduction Using a Tableau Calculus, , and . SAS, volume 983 of Lecture Notes in Computer Science, page 348-365. Springer, (1995)Correctness of Program Transformations as a Termination Problem., , and . IJCAR, volume 7364 of Lecture Notes in Computer Science, page 462-476. Springer, (2012)Decidability of Arity-Bounded Higher-Order Matching.. CADE, volume 2741 of Lecture Notes in Computer Science, page 488-502. Springer, (2003)Unification of program expressions with recursive bindings., and . PPDP, page 160-173. ACM, (2016)Monadic Second-Order Unification Is NP-Complete., , and . RTA, volume 3091 of Lecture Notes in Computer Science, page 55-69. Springer, (2004)