Abstract
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 language | English |
---|---|
Title of host publication | Proceedings of AMAST'97 |
Publisher | Springer Verlag |
Publication date | 1997 |
Publication status | Published - 1997 |
Event | AMAST'97 - Sydney Duration: 1 Jan 1997 → … |
Conference
Conference | AMAST'97 |
---|---|
City | Sydney |
Period | 01/01/1997 → … |