Boiten, E.A. (1989) Inverting the Flow of Computation in Tree-like Recursive Functions. In: UNSPECIFIED.
| The full text of this publication is not available from this repository. (Contact us about this Publication) |
Abstract
This is an earlier presentation of part of /pubs/1992/159. The latter paper is also part of my PhD thesis.
| Item Type: | Conference or workshop item (UNSPECIFIED) |
|---|---|
| Additional information: | Superseded by cite159 |
| Uncontrolled keywords: | transformational programming, tabulation, tupling,memoisation |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 29 Jul 2009 19:48 |
| Last Modified: | 24 Apr 2012 14:42 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/20944 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
