Abstract
We study a variety of ways to specify a two sorted structure involving the Booleans B, with constants true and false and a finite set D with an equality function eq to the Booleans, under the assumption that there is a constant (name) for each element of D. The specifications are evaluated with respect to several properties, like textual length, efficiency in execution and the use of special features.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Foundations of Computer Science
Disclaimer: 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.