Results 1 
8 of
8
Three approaches to type structure
 In International Joint Conference on Theory and Practice of Software Development (TAPSOFT
, 1985
"... ABSTRACT We examine three disparate views of the type structure of]programming languages: Milner's type deduction system and polymorphic ~[e_.!t construct, the theory of subtypes and generic operators, and the polymorphic or secondorder typed lambda calculus. These approaches are illustrated w ..."
Abstract

Cited by 71 (0 self)
 Add to MetaCart
(Show Context)
ABSTRACT We examine three disparate views of the type structure of]programming languages: Milner's type deduction system and polymorphic ~[e_.!t construct, the theory of subtypes and generic operators, and the polymorphic or secondorder typed lambda calculus. These approaches are illustrated with a functional language including product, sum and list constructors. The syntactic behavio ~ of types is formalized with ~ype inference rules, bus their semantics is treated intuitively. I.
On Observational Equivalence and Algebraic Specification
, 1987
"... The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specificationbuilding operation are studied. We begin with a defmition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope wit ..."
Abstract

Cited by 69 (14 self)
 Add to MetaCart
The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specificationbuilding operation are studied. We begin with a defmition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope with unreachable algebras and also how it may be generalised to make sense under an arbitrary institution. Behavioural equivalence is treated as an important special case of observational equivalence, and its central role in program development is shown by means of an example.
A new semantics for Clear
"... Summary. A semantics for the Clear specification language is given. The language of set theory is employed to present constructions corresponding to Clear's specificationcombining operations, which are then used as the basis for a denotational semantics. This is in contrast to Burstall and Gog ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Summary. A semantics for the Clear specification language is given. The language of set theory is employed to present constructions corresponding to Clear's specificationcombining operations, which are then used as the basis for a denotational semantics. This is in contrast to Burstall and Goguen's 1980 semantics which described the meanings of these operations
Label algebras: a systematic use of terms
 In Bidot and Choppy [7
, 1991
"... We give the main definitions and results of a new framework for algebraic specifications: the framework of label algebras. The main idea underlying our approach is that the semantics of algebraic specifications can be deeply improved when the satisfaction relation is defined via assignments with ra ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
We give the main definitions and results of a new framework for algebraic specifications: the framework of label algebras. The main idea underlying our approach is that the semantics of algebraic specifications can be deeply improved when the satisfaction relation is defined via assignments with range in terms instead of values. Surprisingly, there are several cases where even if two terms have the same value, it is possible that one of them is a suitable instance of a variable in an formula while the other one is not. It is for instance the case for algebraic specifications with exception handling or with observability features. We show that our approach is a useful tool for solving this problem.
Parameterized Recursion Theory  A Tool for the Systematic Classification of Specification Methods
 Proceedings of the Third International Conference on Algebraic Methodology and Software Technology, 1993, Workshops in Computing
"... We examine four specification methods with increasing expressiveness. Parameterized recursion theory allows to characterize the power of parameterization in the methods, using a computational model based on Moschovakis' search computability. The four specification methods can be characterized b ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
We examine four specification methods with increasing expressiveness. Parameterized recursion theory allows to characterize the power of parameterization in the methods, using a computational model based on Moschovakis' search computability. The four specification methods can be characterized by four different notions of semicomputable parameterized abstract data type, which differ in the availability of the parameter algebra and of nondeterminism. These characterizations further lead to different algebraic properties of specifiable PADTs. Together with example PADTs, they enable us to prove a hierarchy theorem. Given a sample PADT, the algebraic properties help to find out the lowest position (= most restricted method) in the hierarchy usable to specify it. This is important because the available tools may become weaker, if we choose a too general method.
Exception Handling and Term Labelling
 TAPSOFT'93: Theory and Practice of Software Development. 4th International Joint Conference CAAP/FASE
, 1993
"... Abstract: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exceptions, etc. This formalism is capable of treating all the exceptional cases, including the following ones: “i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exceptions, etc. This formalism is capable of treating all the exceptional cases, including the following ones: “intrinsic ” exceptions which are related to the underlying data structure (for instance, popping an emptstack or applying predecessor on zero for natural numbers), exceptions which are relied on “dynamic ” properties (as an acces to a noninitialized array cell) or else exceptions which are due to certain limitations (mainly bounded data structures). We show that within the already existing frameworks, the case of bounded data structures with certain recoveries of exceptional values remains unsolved. First, we justify the usefulness of “labelling ” some terms in order to easily specify exceptions without inconsistency, and we then define a general framework of label algebras which allows us to “type ” terms instead of values. Exception algebras and exception specifications are defined as a direct application of label algebras. Indeed, the usual inconsistency problems raised by exception handling are avoided by the possibility of labelling terms. As a conclusion, we also sketch out how far the application domain of label algebras seems to be much more general than exception handling. Keywords: Algebraic specifications of abstract data types, Error and exception handling, Exception recovery, Bounded data structures, Structured specifications. 1
AUTOMATIC PROGRAMMING USING ABSTRACT DATA TYPES
"... In this paper we first try to characterize one meaning of automatic programming. We consider it to be one part of the Programming environment related to Artificial Intelligence techniques. We then illustrate an automatic programning process, on a simple example, using an Abstract Data Type theory to ..."
Abstract
 Add to MetaCart
In this paper we first try to characterize one meaning of automatic programming. We consider it to be one part of the Programming environment related to Artificial Intelligence techniques. We then illustrate an automatic programning process, on a simple example, using an Abstract Data Type theory to which we add the not ion of schemes which are Type decomposition. We conclude that all the concepts treated in this paper must be contained in one way or another in any automatic programming system. However this necessitates further study in such theoretical fields as Abstract Data
Parametric Polymorphism in OBJ3
, 1997
"... This paper describes the modular polymorphic functional programming language OBJP. OBJP is an extension of OBJ3 as OBJP allows parametric polymorphism for firstorder types in the sense of the HindleyMilner type system. In this paper we give an overview of the language and present in two ..."
Abstract
 Add to MetaCart
(Show Context)
This paper describes the modular polymorphic functional programming language OBJP. OBJP is an extension of OBJ3 as OBJP allows parametric polymorphism for firstorder types in the sense of the HindleyMilner type system. In this paper we give an overview of the language and present in two program examples the polynomial ring operands sum and product. These examples show the special features of OBJP and how to use the features overloading, subtyping (wrt. set inclusion), and parametric polymorphism at the same time. 3 WilhelmSchickardInstitut972 1 Introduction OBJ3 [GWM + 93] is a functional programming language with firstorder function types. OBJ3 differs from other programming languages by two special features: overloading 1 of function symbols and the possibility to order the sorts (subtyping). This ordering is induced by set inclusion on the carrier sets. The algebraic semantics of OBJ3 is based on the theory of ordersorted algebras [GM89]. Furthermor...