Hans Zantema

Hans Zantema (1956) is a Dutch mathematician and computer scientist, and professor at Radboud University in Nijmegen, known for his work on termination analysis.^[1]^[2]

Biography[edit]

Born in Goingarijp, The Netherlands, Zantema received his PhD in algebraic number theory in 1983 at the University of Amsterdam under supervision of Hendrik Lenstra Jr. for the thesis, entitled "Integer Valued Polynomials in Algebraic Number Theory."^[3]

After graduation Zantema spent a few years of employment in the industry before he switched to computer science: from 1987 to 2000 at Utrecht University and since 2000 at Eindhoven University of Technology.

Since 2007 he is a part-time full professor at Radboud University in Nijmegen. His main achievements are in term rewriting systems, in particular in automatically proving termination of term rewriting. His name is attached to Zantema's problem,^[4] namely does the string rewrite system 0011 -> 111000 terminate.

Selected publications[edit]

Zantema, Hans. 1983. Integer Valued Polynomials in Algebraic Number Theory. PhD thesis
Zantema, Hans. 2007 De achterkant van Sudoku. Oplossen, programmeren en ontwerpen. Aramith Hersengymnastiek.

Articles, a selection:

Zantema, Hans. "Termination of term rewriting: interpretation and type elimination." Journal of Symbolic Computation 17.1 (1994): 23–50.
Zantema, Hans. "Termination of term rewriting by semantic labelling^{[permanent dead link]}." Fundamenta Informaticae 24.1 (1995): 89-105.
Endrullis, Jörg, Johannes Waldmann, and Hans Zantema. "Matrix interpretations for proving termination of term rewriting." Journal of Automated Reasoning 40.2-3 (2008): 195–220.

References[edit]

^ Arts, Thomas, and Jürgen Giesl. "Termination of term rewriting using dependency pairs." Theoretical Computer Science 236.1 (2000): 133-178.
^ Ohlebusch, Enno. Advanced topics in term rewriting. Springer, 2002.
^ Hans Zantema at the Mathematics Genealogy Project
^ Thierry Coquand and Henrik Persson. A proof-theoretical investigation of Zantema's problem. Computer Science Logic. Lecture Notes in Computer Science Volume 1414, pp. 177-188, Springer, 1988.

External links[edit]

Hans Zantema's homepage at tue.nl

[1] Arts, Thomas, and Jürgen Giesl. "Termination of term rewriting using dependency pairs." Theoretical Computer Science 236.1 (2000): 133-178.

[2] Ohlebusch, Enno. Advanced topics in term rewriting. Springer, 2002.

[3] Hans Zantema at the Mathematics Genealogy Project

[4] Thierry Coquand and Henrik Persson. A proof-theoretical investigation of Zantema's problem. Computer Science Logic. Lecture Notes in Computer Science Volume 1414, pp. 177-188, Springer, 1988.

[1]

[2]

[3]

[4]

Authority control databases
International	ISNI VIAF 2 WorldCat
National	Belgium Netherlands
Academics	DBLP Google Scholar MathSciNet Mathematics Genealogy Project zbMATH
Other	IdRef