Non-omega-overlapping TRSs are UN
- Submitting institution
-
The University of Kent
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9465
- Type
- E - Conference contribution
- DOI
-
-
- Title of conference / published proceedings
- 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)
- First page
- 22:1
- Volume
- 52
- Issue
- -
- ISSN
- 1868-8969
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2016
- URL
-
https://kar.kent.ac.uk/55349/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper establishes the consistency of an important class of rewrite systems. This is significant because it solves one of the open problems listed by the International Conference on Rewriting Techniques and Applications, proposed in 1989. The open problem was an assumption that underpins the type safety of the Glasgow Haskell Compiler.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
