PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Schwichtenberg, Helmut"

Author of the publication

copydeleteadd this publication to your clipboard
Program Extraction from Nested Definitions.

, , and . ITP, volume 7998 of Lecture Notes in Computer Science, page 370-385. Springer, (2013)

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.

Hon. -Prof. Dr. -Ing. Helmut Lotz University of Stuttgart

Prof. iR Dr. Helmut Bertagnolli University of Stuttgart

Dr. Helmut Haas University of Stuttgart

Univ. -Prof. Dr. -Ing. Helmut Bott University of Stuttgart

Univ. -Prof. Dr. -Ing. Helmut Seifert University of Stuttgart

 

Other publications of authors with the same name

Minimal from classical proofs., and . Ann. Pure Appl. Logic, 164 (6): 740-748 (2013)Finite Notations for Infinite Terms.. Ann. Pure Appl. Logic, 94 (1-3): 201-222 (1998)Term rewriting for normalization by evaluation., , and . Inf. Comput., 183 (1): 19-42 (2003)On Bar Recursion of Types 0 and 1.. J. Symb. Log., 44 (3): 325-329 (1979)A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis.. J. UCS, 11 (12): 2086-2095 (2005)Linear Ramified Higher Type Recursion and Parallel Complexity., , , and . Proof Theory in Computer Science, volume 2183 of Lecture Notes in Computer Science, page 1-21. Springer, (2001)Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen.. Computation Theory and Logic, volume 270 of Lecture Notes in Computer Science, page 334-348. Springer, (1987)Program Extraction from Normalization Proofs., , , and . Studia Logica, 82 (1): 25-49 (2006)An upper bound for reduction sequences in the typed λ-calculus.. Arch. Math. Log., 30 (5-6): 405-408 (1991)Higher type recursion, ramification and polynomial time., , and . Ann. Pure Appl. Logic, 104 (1-3): 17-30 (2000)