Results 1  10
of
556,360
Operational termination of membership equational programs. the ordersorted way
, 2008
"... Our main goal is automating termination proofs for programs in rewritingbased languages with features such as: (i) expressive type structures, (ii) conditional rules, (iii) matching modulo axioms, and (iv) contextsensitive rewriting. Specifically, we present a new operational termination method for ..."
Abstract

Cited by 24 (11 self)
 Add to MetaCart
for membership equational programs with features (i)(iv) that can be applied to programs in membership equational logic (MEL). The method first transforms a MEL program into a simpler, yet semantically equivalent, conditional ordersorted (OS) program. Subsequent trasformations make the OSprogram unconditonal
OrderSorted Dependency Pairs
, 2008
"... Types (or sorts) are pervasive in computer science and in rewritingbased programming languages, which often support subtypes (subsorts) and subtype polymorphism. Programs in these languages can be modeled as ordersorted term rewriting systems (OSTRSs). Often, termination of such programs heavily d ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Types (or sorts) are pervasive in computer science and in rewritingbased programming languages, which often support subtypes (subsorts) and subtype polymorphism. Programs in these languages can be modeled as ordersorted term rewriting systems (OSTRSs). Often, termination of such programs heavily
Termination of OrderSorted Rewriting
"... We present a method for proving termination of ordersorted rewrite systems by transforming an ordersorted rewrite system into an unsorted one such that termination of the latter implies termination of the ordersorted system. The method is inspired by ideas of Gnaedig and Ganzinger and contains as ..."
Abstract
 Add to MetaCart
We present a method for proving termination of ordersorted rewrite systems by transforming an ordersorted rewrite system into an unsorted one such that termination of the latter implies termination of the ordersorted system. The method is inspired by ideas of Gnaedig and Ganzinger and contains
OrderSorted Inductive Types
, 1999
"... System F ! is an extension of system F ! with subtyping and bounded quantification. Ordersorted algebra is an extension of manysorted algebra with overloading and subtyping. We combine both formalisms to obtain IF ! , a higherorder typed calculus with subtyping, bounded quantification a ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
and ordersorted inductive types, i.e. data types with builtin subtyping and overloading. Moreover we show that IF ! enjoys important metatheoretic properties, including confluence, strong normalization, subject reduction and decidability of typechecking. 1 Introduction Typed functional programming
Sort Inheritance for OrderSorted Equational Presentations
 In Recent Trends in Data Types Specification
, 1995
"... In an algebraic framework, where equational, membership and existence formulas can be expressed, decorated terms and rewriting provide operational semantics and decision procedures for these formulas. We focus in this work on testing sort inheritance, an undecidable property of specifications, neede ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
In an algebraic framework, where equational, membership and existence formulas can be expressed, decorated terms and rewriting provide operational semantics and decision procedures for these formulas. We focus in this work on testing sort inheritance, an undecidable property of specifications
HigherOrder OrderSorted Resolution
 FB Informatik, Universitat des Saarlandes
, 1994
"... The introduction of sorts to firstorder automated deduction has brought greater conciseness of representation and a considerable gain in efficiency 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 generalizati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
generalization of Huet's Constrained Resolution to an ordersorted type theory \SigmaT with term declarations. This system builds certain taxonomic axioms into the unification and conducts reasoning with them in a controlled way. We make this notion precise by giving a relativization operator that totally
Logic Programming over Polymorphically OrderSorted Types
, 1989
"... This thesis presents the foundations for relational logic programming over polymorphically ordersorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higherorder functional programming, with the notion of ordersorted typing, which ha ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
has been developed for equational firstorder specification and programming. Polymorphically ordersorted types are obtained as canonical models of a class of specifications in a suitable logic accommodating sort functions. Algorithms for constraint solving, type checking and type inference are given
The Skyline Operator
 IN ICDE
, 2001
"... We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is interesting if it is not dominated by any other point. For example, a hotel might be interesting for somebody traveling to Nass ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is interesting if it is not dominated by any other point. For example, a hotel might be interesting for somebody traveling
A Structural Approach to Operational Semantics
, 1981
"... Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be ..."
Abstract

Cited by 1541 (3 self)
 Add to MetaCart
Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
, indeterministic choice, interleaving, and hiding, and provides a mutual recursion operator. cc(.L,t) is (intentionally!) very similar to Milner’s CCS, but for the radically different underlying concept of communication, which, in fact, pro’ The class is founded on the notion of “constraint logic programming
Results 1  10
of
556,360