Howe, J.M. and King, Andy (2002) Correctness of Set-Sharing with Linearity. Technical report. Computing Laboratory, Canterbury
| Postscript | ||
|
Download (206Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
|
Download (194Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
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: | Monograph (Technical report) |
|---|---|
| Additional information: | Report 3-O2 |
| 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: | 24 Nov 2008 18:00 |
| Last Modified: | 25 Jun 2012 14:17 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/13819 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
