Thomas, Muffy and Watson, Phil (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)
| 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: | 27 May 2014 11:28 |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21007 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- CSV
- Depositors only (login required):
