Boiten, Eerke Albert (1989) Inverting the Flow of Computation in Tree-like Recursive Functions. In: Apers, P.M.G. and Bosman, D. and van Leeuwen, J., eds. Computer Science in the Netherlands 1989. . pp. 33-56. Stichting Mathematisch Centrum, Amsterdam (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:20944)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. |
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 (Paper) |
---|---|
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: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Eerke Boiten |
Date Deposited: | 29 Jul 2009 19:48 UTC |
Last Modified: | 05 Nov 2024 09:58 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/20944 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):