Premium
A short note concerning lazy reduction rules for append
Author(s) -
Sleep M. R.,
Holmström S.
Publication year - 1982
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380121109
Subject(s) - append , computer science , reduction (mathematics) , programming language , mathematics , geometry
We show that informing a lazy evaluator that the APPEND operator is associative reduces the overall worst case performance from O( n 2 ) to O( n ).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom