Abstract
We discuss a data type specification language DSL(?) which is obtained from the first order language L(?) for a given signature ? by augmenting it with schemes. A specification is a pair (?, $$\mathbb{F}$$ ) with $$\mathbb{F}$$ a finite set of axioms in DSL(?). As semantics of such specifications we propose: standard model semantics, SMS. We investigate DSL/SMS as a specification mechanism for data types and compare it with both first order and algebraic specifications. A concise theory of parametrized data types is developed in this context.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
