Advertisement

Permissive subsorted partial logic in CASL

  • Maura Cerioli
  • Anne Haxthausen
  • Bernd Krieg-Brückner
  • Till Mossakowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1349)

Abstract

This paper presents a permissive subsorted partial logic used in the CoFI Algebraic Specification Language. In contrast to other ordersorted logics, subsorting is not modeled by set inclusions, but by injective embeddings allowing for more general models in which subtypes can have different data type representations. Furthermore, there are no restrictions like monotonicity, regularity or local filtration on signatures at all. Instead, the use of overloaded functions and predicates in formulae is required to be sufficiently disambiguated, such that all parses have the same semantics. An overload resolution algorithm is sketched.

Keywords

Function Symbol Atomic Formula Predicate Symbol Concrete Syntax Partial Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AM75]
    Arbib and Manes. Arrows, Structures, and Functors — The categorical Imperative. Academic Press Inc, 1975.Google Scholar
  2. [Bur82]
    P. Burmeister. Partial algebras — survey of a unifying approach towards a two-valued model theory for partial algebras. Algebra Universalis, 15:306–358, 1982.Google Scholar
  3. [CM97]
    M. Cerioli and J. Meseguer. May I borrow your logic? (transporting logical structures along maps). Theoretical Computer Science, 173:311–347, 1997.Google Scholar
  4. [CMR97]
    M. Cerioli, T. Mossakowski, and H. Reichel. From total equational to partial first order. In E. Astesiano, H.-J. Kreowski, and B. Krieg-Brückner, editors, Algebraic Foundations of Systems Specifications. 1997. To appear 9.Google Scholar
  5. [GD94]
    Joseph Goguen and RĂzvan Diaconescu. An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science, 4(3):363–392, September 1994.Google Scholar
  6. [GM86]
    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.Google Scholar
  7. [GM92]
    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.Google Scholar
  8. [Hax97]
    A.E. Haxthausen. Order-sorted algebraic specifications with higher-order functions. Theoretical Computer Science, 183, 1997. To appear.Google Scholar
  9. [HN96]
    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.Google Scholar
  10. [Kol96]
    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.Google Scholar
  11. [Mos96]
    T. Mossakowski. Representations, hierarchies and graphs of institutions. PhD thesis, Bremen University, 1996.Google Scholar
  12. [Mos97]
    Peter D. Mosses. CoFI: The common framework initiative for algebraic specification and development. Invited paper for TAPSOFT'97, 1997.Google Scholar
  13. [Rei87]
    H. Reichel. Initial Computability, Algebraic Specifications and Partial Algebras. Oxford Science Publications, 1987.Google Scholar
  14. [Sco79]
    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.Google Scholar
  15. [CoFI96]
    CoFI: The Common Framework Initiative for Algebraic Specification. CASL — the COFI Algebraic Common Language Tentative Design: Language Summary10, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Maura Cerioli
    • 1
  • Anne Haxthausen
    • 2
  • Bernd Krieg-Brückner
    • 3
  • Till Mossakowski
    • 3
  1. 1.DISIGenova
  2. 2.Dept. of Information TechnologyTechn. University of DenmarkLyngby
  3. 3.BISSUniversität BremenBremen

Personalised recommendations