Olaf Owe
Ole-Johan Dahl
Abstract
Abstract
Linguistic and semantic consequences of combining the ideas of order sorted algebras (as in OBJ) and generator induction (as in Larch) are investigated. It is found that one can gain the advantages of both, in addition to increased flexibility in defining signatures and generator bases. Our treatment also gives rise to typing control stronger in a certain sense than that of OBJ, as well as the detection of inherently inconsistent signatures.
- [Car84] Cardelli, L.: A Semantics of Multiple Inheritance. In:Semantics of Data Types, G. Khan, (ed.), Lecture Notes in Computer Science 173, Springer-Verlag, 1984.Google Scholar
- [CuD85] Rewrite Systems on a Lattice of TypesActa Informatica198522149169Google Scholar
- [Dah87] Dahl, O.-J.: Object Oriented Specification. In:Research Directions in Object-Oriented Programming, B. Shriver and P. Wegner, (eds), MIT Press, 1987.Google Scholar
- [DLO86] Preliminary Report on the Specification and Programming Language ABELResearch Report 1061986NorwayInstitute of Informatics, University of OsloGoogle Scholar
- [FGJ85] Futasugi, K., Goguen, J. A., Jouannaud, J.-P. and Meseguer, J.: Principles of OBJ2.Proc. 1985Symp. on Principles of Programming Languages and Programming, Association for Computing Machinery, 1985, W. Brauer, (ed.), pp. 52–66, Lecture Notes in Computer Science 194, Springer-Verlag, 1985.Google Scholar
- [Gog78] Goguen, J. A.: Exception and Errors Sorts, Coercion and Overloading Operators. SRI International, Computer Science Lab, 1978.Google Scholar
- [GoM87] Goguen, J. A. and Meseguer, J.: Order-Sorted Algebra I: Partial and Overload Operations, Errors and Inheritance. SRI International, Computer Science Lab, 1987.Google Scholar
- [GJM85] Goguen, J. A., Jouannaud, J.-P. and Meseguer, J.: Operational Semantics of Order-Sorted Algebra.Proc. 1985 Int. Conf. on Automata, Languages and Programming, W. Brauer (ed.), Lecture Notes in Computer Science 194, Springer-Verlag, 1985.Google Scholar
- [GoM88] Goguen, J. A. and Meseguer, J.: Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Polymorphism, and Partial Operations. Draft of 17 May 1988, SRI International.Google Scholar
- [Gut75] Guttag, J. V.: The Specification and Application to Programming of Abstract Data Types. Ph.D. Thesis, Computer Science Department, University of Toronto, 1975.Google Scholar
- [GHW85] Larch in Five Easy Pieces1985Palo Alto, CaliforniaDigital Systems Research CenterGoogle Scholar
- [Mil83] Milner, R.: A Proposal for Standard ML. Report CSR-157-83, Computer Science Department, University of Edinburgh (1983). AlsoConference Record of the 1984 ACM Symposium on LISP and Functional Programming, Austin, Texas (1984) pp. 184–197.Google Scholar
Index Terms
- Generator induction in order sorted algebras
Recommendations
HasCasl: Integrated higher-order specification and program development
We lay out the design of HasCasl, a higher order extension of the algebraic specification language Casl that serves both as a wide-spectrum language for the rigorous specification and development of software, in particular but not exclusively in modern ...
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks
ICFEM '97: Proceedings of the 1st International Conference on Formal Engineering MethodsCAFE is the name of a network based environment now under development for supporting systematic creation, checking, verification, and maintenance of formal specifications. CAFE has an algebraic specification language called CafeOBJ as its main ...
CSP-CASL: a new integration of process algebra and algebraic specification
Algebraic methods in language processingCSP-CASL integrates the process algebra CSP [T. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood cliffs, NJ, 1985; A.W. Roscoe, The Theory and Practice of Concurrency, Prentice-Hall, Englewood cliffs, NJ, 1998] with the algebraic ...
Comments