Permissive Subsorted Partial Logic in CASL
نویسندگان
چکیده
This paper presents a permissive subsorted partial logic used in the CoFI Algebraic Speciication Language. In contrast to other order-sorted logics, subsorting is not modeled by set inclusions, but by injec-tive embeddings allowing for more general models in which subtypes can have diierent data type representations. Furthermore, there are no restrictions like monotonicity, regularity or local ltration on signatures at all. Instead, the use of overloaded functions and predicates in formulae is required to be suuciently disambiguated, such that all parses have the same semantics. An overload resolution algorithm is sketched.
منابع مشابه
Generalized interpolation in CASL
In this paper we consider the partial many-sorted first-order logic and its extension to the subsorted partial many-sorted first-order logic that underly the Casl specification formalism. First we present counterexamples showing that the generalization of the Craig Interpolation Property does not hold for these logics in general (i.e., with respect to arbitrary signature morphisms). Then we for...
متن کاملStatic semantic analysis and theorem proving for CASL
This paper presents a static semantic analysis for CASL, the Common Algebraic Speciication Language. Abstract syntax trees are generated including subsorts and overloaded functions and predicates. The static semantic analysis, through the implementation of an overload resolution algorithm, checks and qualiies these abstract syntax trees. The result is a fully qualiied CASL abstract syntax tree ...
متن کاملSpecifying Real Numbers in CASL
We present a weak theory BasicReal of the real numbers in the rst order speciication language Casl. The aim is to provide a datatype for practical purposes, including the central notions and results of basic analysis. BasicReal captures for instance e and ; as well as the trigonometric and other standard functions. Concepts such as continuity, diierentiation and integration are shown to be deen...
متن کاملExtending Casl by Late Binding
We deene an extension of Casl, the standard language for algebraic speciication, with a late binding mechanism. More precisely, we introduce a special kind of functions called methods, for which, diierently to what happens for usual functions, overloading resolution is delayed at evaluation time and not required to be conservative. The extension consists, at the semantic level, in the deenition...
متن کاملCasl the Common Algebraic Speciication Language 1
Casl is an expressive language for the formal speciication of functional requirements and modular design of software. It has been designed by CoFI, the international Common Framework Initiative for algebraic speciication and development. It is based on a critical selection of features that have already been explored in various contexts, including subsorts, partial functions, rst-order logic, an...
متن کامل