( en | de | ru )

 

Disambiguation of "Schwichtenberg, Helmut"

Author of the publication

copydeleteadd this publication to your clipboard
An upper bound for reduction sequences in the typed λ-calculus.

. Arch. Math. Log., 30 (5-6): 405-408 (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.

Helmut Schwichtenberg

Helmut Schwichtenberg

Helmut Schwichtenberg

Michael Schwichtenberg

Jörg Schwichtenberg

 

Other publications of authors with the same name

Mathematical Logic. (2004)Minimal from classical proofs., and . Ann. Pure Appl. Log., 164 (6): 740-748 (2013)Finite Notations for Infinite Terms.. Ann. Pure Appl. Log., 94 (1-3): 201-222 (1998)Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen.. Computation Theory and Logic, volume 270 of Lecture Notes in Computer Science, page 334-348. Springer, (1987)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. Univers. Comput. Sci., 11 (12): 2086-2095 (2005)Term rewriting for normalization by evaluation., , and . Inf. Comput., 183 (1): 19-42 (2003)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. Log., 104 (1-3): 17-30 (2000)Basic proof theory., and . Cambridge tracts in theoretical computer science Cambridge University Press, (1996)