Balanced trees with removals: an exercise in rewriting and proof

Reade, C.M.P. (1992) Balanced trees with removals: an exercise in rewriting and proof. Science of Computer Programming, 18(2), pp. 181-204. ISSN (print) 0167-6423

Full text not available from this archive.
Item Type: Article
Uncontrolled Keywords: Functional programming
Research Area: Computer science and informatics
Faculty, School or Research Centre: Faculty of Business and Law
Faculty of Business and Law > Kingston Business School (Informatics and Operations Management) (until July 2013)
Depositing User: Robert Elves
Date Deposited: 12 Dec 2007
Last Modified: 04 Aug 2010 10:16
URI: http://eprints.kingston.ac.uk/id/eprint/2043

Actions (Repository Editors)

Item Control Page Item Control Page