Permissive Subsorted Partial Logic in CASL.

Maura Cerioli, Anne Elisabeth Haxthausen, Bernd Krieg-Brückner, Till Mossakowski

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


    This paper presents a permissive subsorted partial logic used in the CoFI Algebraic Specification Language. In contrast to other order-sorted 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.
    Original languageEnglish
    Title of host publicationProceedings of AMAST'97
    PublisherSpringer Verlag
    Publication date1997
    Publication statusPublished - 1997
    EventAMAST'97 - Sydney
    Duration: 1 Jan 1997 → …


    Period01/01/1997 → …


    Dive into the research topics of 'Permissive Subsorted Partial Logic in CASL.'. Together they form a unique fingerprint.

    Cite this