Abstract

A formalism for declarative specification and programming is introduced that forms a logical and methodological framework for program and system specification and construction. It combines axiomatic techniques based on logical concepts for specifying properties and the possibility to introduce names for objects. In particular it comprises within one formalism, the possibilities of formulating specifications and defining algorithms. The logical formalism is based more or less on typed predicate logic. The development rules are particular proof rules together with the inference rules of predicate logic. As a special aspect, the authors consider logical formulas which explicitly specify typed identifiers as elements of signatures. >

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 call

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.