Typability in partial groupoids (2009)
Adapting a claim of M. Kracht, we establish a characterization of the typable partial applicative algebras.
Iteratively algebraic orders (2008)
A short proof of a theorem of M.H. Albert, and its application to lattices.
Iteratively algebraic orders (2008)
A short proof of a theorem of M.H. Albert, and its application to lattices.
Remarks on Thatte's Transformation of Term Rewriting Systems (2004)
Luttik, S.P., Rodenburg, P.H., Verma, R.M.
We carry out a detailed analysis of Thatte's transformation of term rewriting systems. We refute an earlier claim that this transformation preserves confluence for weakly persistent systems. We prove...
Transformation of Reduction Systems - a view on proving correctness (1996)
Supervisors Prof. Dr, J. A. Bergstra, Dr. P. H. Rodenburg, Bas Luttik, Bas Luttik, Bas Luttik
Reduction Systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.3 Term Rewriting Systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.3.1 Terms : : : : : : : : : : :...
Parallel object-oriented term rewriting : the booleans (1988)
Rodenburg, P.H., Vrancken, J.L.M.
As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the...
Manufacturing a cartesian closed category with exactly two objects out of a C-monoid (1988)
A construction is described of a cartesian closed category A with exactly two elements out of a C-monoid M such that M can be recovered from A without reference to the construction.
Gauß eliminition a term rewriting system (1988)
Rodenburg, P.H., Hoekzema, D.J.
We specify the Gauß elimination algorithm algebraically, in a format described in our earlier report [RH]. The specification is to be considered as a term rewriting system: as such, it is complete,...
Specification of the Fast Fourier Transform algorithm as a term rewriting system (1987)
Rodenburg, P.H., Hoekzema, D.J.
We specify an algorithm for multiplying polynomials with complex coefficients incorporating, the Fast Fourier Transform algorithm of Cooley and Tukey [CT]. The specification formalism we use is a...
Termination And Confluence In Infinitary Term Rewriting
. The basic notions of the theory of term rewriting are defined for terms that may involve function letters of infinite arity. A sufficient condition for completeness is derived, and its use...