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.
Official URL: http://dx.doi.org/10.1016/0167-6423(92)90009-Z
| 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) |
| 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 |