A reduction system where an expression is represented as a string of function names, constants and parentheses. It is reduced by replacing parts of the string representing subterms by their value. It is harder to represent sharing of subexpressions in string reduction than in graph reduction. (1995-02-06)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ b ] [ be ] [ bt ] [ by ] [ ch ] [ ci ] [ co ] [ con ] [ cons ] [ de ] [ du ] [ ed ] [ edu ] [ er ] [ es ] [ expression ] [ fi ] [ file ] [ function ] [ gr ] [ graph ] [ graph reduction ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ la ] [ Lex ] [ lu ] [ mo ] [ mod ] [ module ] [ ms ] [ na ] [ nc ] [ ng ] [ ns ] [ pa ] [ parent ] [ parentheses ] [ ph ] [ pl ] [ pr ] [ query ] [ rc ] [ re ] [ reduction ] [ se ] [ sh ] [ shar ] [ si ] [ st ] [ string ] [ su ] [ sy ] [ system ] [ th ] [ to ] [ tr ] [ va ] [ value ]