Zantema, H. (Hantsje)
VIAF ID: 193270744 (Personal)
Permalink: http://viaf.org/viaf/193270744
Preferred Forms
4xx's: Alternate Name Forms (1)
Works
Title | Sources |
---|---|
De achterkant van sudoku : oplossen, programmeren en ontwerpen | |
Basic process algebra with iteration : completeness of its equational axioms | |
Beschrijven en bewijzen | |
Binary decision diagrams by shared rewriting | |
Binary structures in program transformations | |
A complete characterization of termination of 0p1q 1r0s | |
Derivation lengths in term rewriting from interpretations in the naturals | |
Dummy elimination : making termination easier | |
Global restrictions on ramification in number fields | |
Liveness in rewriting | |
Longest segment problems | |
Majority voting : characterization and algorithms | |
Minimizing sums of addition chains | |
Non-looping rewriting | |
Programmeren en correctheid | |
A proof system and a decision procedure for equality logic | |
Resolution and binary decision diagrams cannot simulate each other polynomially | |
Rewrite systems for integer arithmetic | |
Simple termination revisited | |
Syntactical analysis of total termination | |
Termination of constructor systems using semantic unification | |
Termination of term rewriting by semantic labelling | |
Transforming DPLL to resolution | |
Transforming equality logic to propositional logic | |
Well-foundedness of term orderings |