Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

Bibliographic Details
Main Author: Laurence, Michael Rupen
Published: Goldsmiths College (University of London) 2004
Subjects:
Online Access:http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416038

Similar Items