Other publications of Hans Zantema
Ph.D. thesis
Title: Integer Valued Polynomials in Algebraic Number Theory,
Institute: University of Amsterdam,
Date of defense: November 16, 1983
Inaugural lecture
Op zoek naar bewijs
Rede uitgesproken bij de
aanvaarding van het ambt van hoogleraar Applications of term
rewriting in theorem proving aan de Faculteit der
Natuurwetenschappen, Wiskunde en Informatica van de Radboud
Universiteit Nijmegen op vrijdag 30 mei 2008
Books
- J. D. Fokker and H. Zantema and S. D. Swierstra,
Programmeren en Correctheid,
publisher Academic Service, 1991, ISBN 90 6233 681 7, 195 pages
- H. Zantema and P. W. H. Lemmens
Beschrijven en Bewijzen,
publisher Delft University Press, 1999, ISBN 90-407-1942-X, 169 pages
- H. Zantema
De achterkant van SUDOKU,
publisher Gottmer, Haarlem, 2007, ISBN 978-90-6834-216-1, 146 pages
Handbook contribution
- H. Zantema
Termination,
chapter 6 in Term Rewriting Systems, edited by TERESE, pp 181 - 259
publisher Cambridge University Press, 2003, ISBN 0-521-39115-6, 884 pages
Selection of technical reports
- H. Zantema
Binary Structures in Program Transformations
(RUU-CS-88-24, July 1988)
- H. Zantema
Majority voting: characterization and algorithms
(RUU-CS-88-32, October 1988)
- W. J. Fokkink, H. Zantema
Basic process algebra with iteration: completeness of its equational axioms
(RUU-CS-93-40)
- A. Middeldorp, H. Zantema
Simple termination revisited
(RUU-CS-93-41)
- T. Arts, H. Zantema
Termination of logic programs via labelled term rewrite systems
(UU-CS-1994-20)
- M. C. F. Ferreira, H. Zantema
Syntactical analysis of total termination
(UU-CS-1994-28)
- H. R. Walters, H. Zantema
Rewrite systems for integer arithmetic
(UU-CS-1994-43)
- H. Zantema, A. Geser
A complete characterization of termination of 0^p 1^q -> 1^r 0^s
(UU-CS-1994-44)
- M. C. F. Ferreira, H. Zantema
Well-foundedness of term orderings
(UU-CS-1994-46)
- M. C. F. Ferreira, H. Zantema
Dummy elimination: making termination easier
(UU-CS-1994-47)
- H. Zantema
Total termination of term rewriting is undecidable
(UU-CS-1994-55)
- W. J. Fokkink, H. Zantema
A complete equational axiomatization for BPAde with prefix iteration
(UU-CS-1995-10)
-
T. Arts, H. Zantema
Termination of constructor systems using semantic unification
(UU-CS-1995-17)
-
W. Fokkink, H. Zantema
Termination modulo equations by abstract commutation with an application to iteration
Department of Philosophy, Logic group preprint series no. 153, January
1996
-
H. Zantema, A. Geser
Non-looping rewriting
(UU-CS-1996-03)
-
A. Middeldorp, H. Ohsaki, H. Zantema
Transforming termination by self-labelling
(UU-CS-1996-15)
-
H. Zantema, H. Bodlaender
Sizes of decision tables and decision trees
(UU-CS-1999-31)
-
H. Zantema
Termination of Term Rewriting
(UU-CS-2000-04)
-
J. van de Pol, H. Zantema
Binary decision diagrams by shared rewriting
(UU-CS-2000-06)
-
J. F. Groote, H. Zantema
Resolution and binary decision diagrams cannot simulate each
other polynomially
(UU-CS-2000-14)
-
H. Zantema, J. van de Pol
A Rewriting Approach to Binary Decision Diagrams
(TU/e CS-report 01-01)
-
O. Tveretina, H. Zantema
Transforming DPLL to Resolution
(TU/e CS-report 02-07)
-
J. Giesl, H. Zantema
Liveness in Rewriting
Technical report AIB-2002-11,
RWTH Aachen, Germany, TU/e CS-report 03-01
-
H. Zantema
Termination of string rewriting proved automatically
TU/e CS-report 03-14
Miscelaneous
Zantema, H.
Proving termination of rewriting automatically
Nieuwsbrief van de Nederlandse Vereniging voor Theoretische
Informatica, 2008, nr 12, page 25-33