Thomas, M. and Watson, P. (1991) Generalising diverging sequences of rewrite rules by synthesising new sorts. In: Functional Programming, Glasgow 1990, Proceedings of the 1990 Glasgow Workshop on Functional Programming.
| The full text of this publication is not available from this repository. (Contact us about this Publication) |
| Item Type: | Conference or workshop item (UNSPECIFIED) |
|---|---|
| Uncontrolled keywords: | term rewriting, regular tree languages |
| 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: | 03 Aug 2009 18:07 |
| Last Modified: | 18 Jul 2012 08:29 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21007 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
