Menu_Home Home   Menu_Latest Latest   Menu_Search Advanced Search   Menu_Browse_by_Year By Year   Menu_Browse_by_Division By Division
  
Screen decoration graphicsLogo

Equivalence of conservative, free, linear program schemas is decidable

Laurence, Michael R. and Danicic, Sebastian and Harman, Mark and Hierons, Rob and Howroyd, John (2003) Equivalence of conservative, free, linear program schemas is decidable. Theoretical Computer Science, 290 . pp. 831-862.

Full text not available from this repository.


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

Repository Staff Only: item control page