Skip to main content

Generalising diverging sequences of rewrite rules by synthesising new sorts

Thomas, Muffy, Watson, Phil (1991) Generalising diverging sequences of rewrite rules by synthesising new sorts. In: Jones, Simon L. Peyton and Hutton, Graham and Holst, Carsten Kehler, eds. Functional Programming, Glasgow 1990, Proceedings of the 1990 Glasgow Workshop on Functional Programming. Workshops in Computing . pp. 268-273. Springer Verlag (doi:10.1007/978-1-4471-3810-5_23) (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:21007)

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.
Official URL:
https://doi.org/10.1007/978-1-4471-3810-5_23
Item Type: Conference or workshop item (UNSPECIFIED)
DOI/Identification number: 10.1007/978-1-4471-3810-5_23
Uncontrolled keywords: term rewriting, regular tree languages
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: Mark Wheadon
Date Deposited: 03 Aug 2009 18:07 UTC
Last Modified: 09 Mar 2023 11:31 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21007 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.