Gauß eliminition a term rewriting system
Piet H. Rodenburg, D.J. Hoekzema · Utrecht University Repository (Utrecht University) · 1988
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, modulo substitution of a complete term rewriting system in its parametrizede module NUMBERS.