Results 1  10
of
276,947
Ordersorted polymorphism in isabelle
 Logical Environments
, 1993
"... MLstyle polymorphism can be generalized from a singlesorted algebra of types to an ordersorted one by adding a partially ordered layer of “sorts ” on top of the types. Type inference proceeds as in the Hindley/Milner system, except that ordersorted unification of types is used. The resulting sys ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
MLstyle polymorphism can be generalized from a singlesorted algebra of types to an ordersorted one by adding a partially ordered layer of “sorts ” on top of the types. Type inference proceeds as in the Hindley/Milner system, except that ordersorted unification of types is used. The resulting
Rapid prototyping of LOTOS's behavioral expressions in OBJ
, 1990
"... We have written an operational semantics of the behavioral expressions of LOTOS using the algebraic specification language OBJ. LOTOS is an internationally standardized specification language for communication protocols in Open System Interconnections. OBJ is one of the most famous algebraic specifi ..."
Abstract
 Add to MetaCart
specification languages based on ordersorted algebraic semantics. OBJ is executable based on ordersorted rewritings which give operational semantics for ordersorted algebras. In this paper, we show how to write the mechanisms for realizing LOTOS behavioral expressions in OBJ. In particular, the mechanisms
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
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
OrderSorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations
 Theoretical Computer Science
, 1992
"... This paper generalizes manysorted algebra (hereafter, MSA) to ordersorted algebra (hereafter, OSA) by allowing a partial ordering relation on the set of sorts. This supports abstract data types with multiple inheritance (in roughly the sense of objectoriented programming), several forms of pol ..."
Abstract

Cited by 231 (36 self)
 Add to MetaCart
This paper generalizes manysorted algebra (hereafter, MSA) to ordersorted algebra (hereafter, OSA) by allowing a partial ordering relation on the set of sorts. This supports abstract data types with multiple inheritance (in roughly the sense of objectoriented programming), several forms
Colimits of OrderSorted Specifications
 In Recent Trends in Algebraic Development Techniques, Proc. 12th International Workshop, WADT '97
"... . We prove cocompleteness of the category of CASL signatures, of monotone signatures, of strongly regular signatures and of strongly locally filtered signatures. This shows that using these signature categories is compatible with a pushout or colimit based module system. 1 Introduction "Given ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
"Putting theories together to make specifications" [3]. That is, specifications should be developed in a modular way, using colimits to combine different modules properly. An orthogonal question is that of the logic that is used to specify the individual modules. Ordersorted algebra is a
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 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
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 be taken as given: Truthvalues This is the set T = ftt; ffg and is ranged over by (the metavariable) t (and we also happily employ for this (and any other) metavariable sub and superscripts to generate other metavariables: t ; t 0 ; t 1k ).
Probabilistic Latent Semantic Indexing
, 1999
"... Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data. Fitted from a training corpus of text documents by a generalization of the Expectation Maximization algorithm, the utilized ..."
Abstract

Cited by 1207 (11 self)
 Add to MetaCart
Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data. Fitted from a training corpus of text documents by a generalization of the Expectation Maximization algorithm, the utilized
Results 1  10
of
276,947