Correctness of Set-Sharing with Linearity

Howe, Jacob M. and King, Andy (2002) Correctness of Set-Sharing with Linearity. University of Kent, School of Computing, Canterbury, 5 pp. (Full text available)

PDF
Download (198kB)
[img]
Preview

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: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Andy King
Date Deposited: 24 Nov 2008 18:00
Last Modified: 09 Jul 2014 11:59
Resource URI: http://kar.kent.ac.uk/id/eprint/13819 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year