Equivalence of Linear, Free, Liberal, Structured Program Schemas is Decidable in Polynomial Time

Laurence, Mike and Danicic, Sebastian and Harman, Mark and Hierons, Robert Mark and Howroyd, John (2007) Equivalence of Linear, Free, Liberal, Structured Program Schemas is Decidable in Polynomial Time. Theoretical Computer Science, 373 (1--2). pp. 1-18.

Full text not available from this repository.

Item Type:	Article
Subjects:	UNSPECIFIED
ID Code:	324
Deposited By:	Prof Mark Harman
Deposited On:	06 Nov 2007 16:17
Last Modified:	06 Nov 2007 16:17

Repository Staff Only: item control page

Accessibility | Terms and Conditions | Last Modified 01 November 2007