Abstract
Term algebras have been widely used in the theory of abstract data types. Here, the concept of canonical term algebra is generalized to the notion of canonical term functor, which is useful for various aspects of abstract data type specifications. In particular, we show how canonical term functors provide a constraint mechanism in loose specifications and how they constitute a junction between axiomatic and constructive approaches. These concepts are the semantic base for the specification development language ASPIK which has been implemented as a core component of an integrated software development and verification system.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
