Permissive subsorted partial logic in CASL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1349, Issue , 1997, Pages 91-107

  Cerioli, Maura ^a   Haxthausen, Anne ^b   Krieg Brückner, Bernd ^c   Mossakowski, Till ^c  

^a UNIVERSITY OF GENOA   (Italy)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^c UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COBALT COMPOUNDS; FLUORINE COMPOUNDS; SEMANTICS; SOFTWARE ENGINEERING; SPECIFICATION LANGUAGES;

ALGEBRAIC SPECIFICATION LANGUAGES; DATA TYPE; GENERAL MODEL; MONOTONICITY; ORDER SORTED LOGIC; PARTIAL LOGIC; RESOLUTION ALGORITHMS;

COMPUTER CIRCUITS;

EID: 84947940477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0000465     Document Type: Conference Paper

References (15)

1. Arbib and Manes. Arrows, Structures, and Functors - The categorical Imperative. Academic Press Inc, 1975.
2. P. Burmeister. Partial algebras -- survey of a unifying approach towards a two-valued model theory for partial algebras. Algebra Universalis, 15:306-358, 1982
3. M. Cerioli and J. Meseguer. May I borrow your logic? (transporting logical structures along maps). Theoretical Computer Science, 173:311-347, 1997.
4. M. Cerioli, T. Mossakowski, and H. Reichel. From total equational to partial first order. In E. Astesiano, H.-J. Kreowski, and B. Krieg-Briickner, editors, Algebraic Foundations of Systems Specifications. 1997. To appear 9.
5. Joseph Goguen and Răzvan Diaconescu. An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science, 4(3):363-392, September 1994.
6. J. Goguen and J. Meseguer. Eqlog: Equality, types, and generic modules for logic programming. In Douglas DeGroot and Gary Lindstrom, editors, Functional and Logic Programming, pages 295-363. 1986.
7. J. A. Goguen and J. Meseguer. Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105:217-273, 1992.
8. A.E. Haxthausen. Order-sorted algebraic specifications with higher-order functions. Theoretical Computer Science, 183, 1997. To appear.
9. A.E. Haxthausen and F. Nickl. Pushouts of order-sorted algebraic specifications. In Proceedings of AMAST'96, volume 1101 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
10. B. Wolff Kolyang, T. Santen. A structure preserving encoding of Z in Isabelle/HOL. In Proc. 1996 International Conference on Theorem Proving in Higher Order Logic (Turku), volume 1125 of Lecture Notes in Computer Science. 1996.
11. T. Mossakowski. Representations, hierarchies and graphs of institutions. PhD thesis, Bremen University, 1996.
12. Peter D. Mosses. CoFI: The common framework initiative for algebraic specification and development. Invited paper for TAPSOFT'97, 1997.
13. H. Reichel. Initial Computability, Algebraic Specifications and Partial Algebras. Oxford Science Publications, 1987.
14. D. S. Scott. Identity and existence in intuitionistic logic. In M.P. Fourman, C.J. Mulvey, and D.S. Scott, editors, Application of Sheaves, volume 753 of Lecture Notes in Mathematics, pages 660-696. Springer-Verlag, 1979.
15. CoFI: The Common Framework Initiative for Algebraic Specification. CASL - the COFI Algebraic Common Language Tentative Design: Language Summary 10 1996.