Gauß eliminition a term rewriting system
Publication date
1988-01
Authors
Rodenburg, P.H.
Hoekzema, D.J.
Editors
Advisors
Supervisors
DOI
Document Type
Preprint
Metadata
Show full item recordCollections
License
Abstract
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.