Howe, Jacob M., King, Andy (2002) Correctness of Set-Sharing with Linearity. University of Kent, School of Computing, Canterbury, 5 pp. (KAR id:13819)
|
PDF
Language: English |
|
|
Click to download this file (215kB)
Preview
|
Preview |
|
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
Abstract
Zaffanella presents an intriguing abstract unification algorithm for tracing set-sharing with linearity and freeness as part of this doctoral thesis. This note provides a short correctness proof for the main novel aspect of this algorithm.
| Item Type: | Research report (external) |
|---|---|
| Additional information: | Report 3-O2 |
| 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: | Andy King |
| Date Deposited: | 24 Nov 2008 18:00 UTC |
| Last Modified: | 16 Nov 2021 09:51 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/13819 (The current URI for this page, for reference purposes) |
| King, Andy: |
 https://orcid.org/0000-0001-5806-4822
|
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics
