Parametrization for order-sorted algebraic specification
نویسندگان
چکیده
منابع مشابه
Parametrization for Order-Sorted Algebraic Specification
We investigate parametrization for order-sorted algebraic specifications. As a prerequisite we study free constructions for order-sorted algebras and relate the various approaches to order-sorting. Then we analyse parameter passing, the result being that the notion of ordersorted specification has to be restricted in order to establish our main result, namely, that parameter passing satisfies t...
متن کاملMany Sorted Algebraic Data Models for GIS
Although many GIS data models are available, a declarative, operational, well-defined, implementation-independent, and objectoriented language is lacking. Based on the theory of many sorted algebra, this work presents a family of geometric data models. Some geographical data models of urban information systems are illustrated using homomorphism. According to the results, the preferred character...
متن کاملHigher-Order Order-Sorted Resolution
The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalization of Huet's Constrained Resolution to an order-sorted type theory T with term declarations. This sys...
متن کاملReal Parametrization of Algebraic Curves
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization. Optimality criteria such as low degrees in the parametrization or low degree field extensions are met by some parametrization algorithms. In this paper we investigate real curves. Given a parametrizable plane curve ov...
متن کاملAlgebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types
In this paper we present the semantics of a functional logic language with parametric and order-sorted polymorphism. Typed programs consist of a polymorphic signature and a set of constructor-based conditional rewriting rules for which we deene a semantic calculus. The denotational semantics of the language is based on Scott domains interpreting constructors and functions by monotonic and conti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1990
ISSN: 0022-0000
DOI: 10.1016/0022-0000(90)90013-b