Results 1  10
of
2,253
On understanding types, data abstraction, and polymorphism
 ACM COMPUTING SURVEYS
, 1985
"... Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Objectoriented languag ..."
Abstract

Cited by 845 (13 self)
 Add to MetaCart
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Object
Subtyping recursive types
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1993
"... We investigate the interactions of subtyping and recursive types, in a simply typed λcalculus. The two fundamental questions here are whether two (recursive) types are in the subtype relation, and whether a term has a type. To address the first question, we relate various definitions of type equiva ..."
Abstract

Cited by 320 (9 self)
 Add to MetaCart
equivalence and subtyping that are induced by a model, an ordering on infinite trees, an algorithm, and a set of type rules. We show soundness and completeness between the rules, the algorithm, and the tree semantics. We also prove soundness and a restricted form of completeness for the model. To address
PVS: Combining Specification, Proof Checking, and Model Checking
, 1996
"... rem Proving and Typechecking The PVS specification language is based on classical, simply typed higherorder logic, but the type system has been augmented with subtypes and dependent types. Though typechecking is undecidable for the PVS type system, the PVS typechecker automatically checks for simp ..."
Abstract

Cited by 230 (5 self)
 Add to MetaCart
rem Proving and Typechecking The PVS specification language is based on classical, simply typed higherorder logic, but the type system has been augmented with subtypes and dependent types. Though typechecking is undecidable for the PVS type system, the PVS typechecker automatically checks
An extension of system F with subtyping
 Information and Computation
, 1991
"... System F is a wellknown typed lcalculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F <: (pronounced efsub) that combines parametric polymorphism with subtyping. The main focus of the paper is the equational theory of ..."
Abstract

Cited by 112 (10 self)
 Add to MetaCart
System F is a wellknown typed lcalculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F <: (pronounced efsub) that combines parametric polymorphism with subtyping. The main focus of the paper is the equational theory
Typologies of Male Batterers: Three Subtypes and the Differences Among Them
 Psychological Bulletin
, 1994
"... Previous typologies of male batterers, including typologies developed by means of rationaldeductive and empiricalinductive strategies, are reviewed. On the basis of this review, 3 descriptive dimensions (i.e., severity of marital violence, generality of the violence [toward the wife or toward othe ..."
Abstract

Cited by 156 (4 self)
 Add to MetaCart
/antisocial). A developmental model of marital violence is then presented, and the previous literature is reviewed to examine how each batterer subtype might differ on variables of theoretical interest. Finally, some of the methodological limitations of previous typology research are reviewed, and suggestions
Type inference with simple subtypes
 J. Funct. Program
, 1991
"... Subtyping appears in a variety of programming languages, in the form of the "automatic coercion " of integers to reals, Pascal subranges, and subtypes arising from class hierarchies in languages with inheritance. A general framework based on untyped lambda calculus provides a simple seman ..."
Abstract

Cited by 92 (2 self)
 Add to MetaCart
semantic model of subtyping and is used to demonstrate that an extension of Curry’s type inference rules are semantically complete. An algorithm G for computing the most general typing associated with any giv en expression, and a restricted, optimized algorithm GA using only atomic subtyping hypotheses
Subtyping and Polymorphism in ObjectRole Modelling
, 1995
"... Although EntityRelationship (ER) modelling techniques are commonly used for information modelling, ObjectRole Modelling (ORM) techniques are becoming increasingly popular, partly because they include detailed design procedures providing guidelines for the modeller. As with the ER approach, a nu ..."
Abstract

Cited by 36 (22 self)
 Add to MetaCart
encompasses other ERbased and ORMbased information modelling techniques, and highlights how formal subtype definitions facilitate a comprehensive specification of subtype constraints.
Subtyping and Parametricity
, 1993
"... In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic supports the formal definition and use of relational parametricity. We give two models for it, and compare it with other formal ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic supports the formal definition and use of relational parametricity. We give two models for it, and compare it with other formal
Subtyping with Singleton Types
 In Eighth International Workshop on Computer Science Logic
, 1995
"... . We give syntax and a PERmodel semantics for a typed calculus with subtypes and singleton types. The calculus may be seen as a minimal calculus of subtyping with a simple form of dependent types. The aim is to study singleton types and to take a canny step towards more complex dependent subtyping ..."
Abstract

Cited by 49 (4 self)
 Add to MetaCart
. We give syntax and a PERmodel semantics for a typed calculus with subtypes and singleton types. The calculus may be seen as a minimal calculus of subtyping with a simple form of dependent types. The aim is to study singleton types and to take a canny step towards more complex dependent
Simple TypeTheoretic Foundations for ObjectOriented Programming
, 1993
"... We develop a formal, typetheoretic account of the basic mechanisms of objectoriented programming: encapsulation, message passing, subtyping, and inheritance. By modeling object encapsulation in terms of existential types instead of the recursive records used in other recent studies, we obtain a s ..."
Abstract

Cited by 160 (17 self)
 Add to MetaCart
We develop a formal, typetheoretic account of the basic mechanisms of objectoriented programming: encapsulation, message passing, subtyping, and inheritance. By modeling object encapsulation in terms of existential types instead of the recursive records used in other recent studies, we obtain a
Results 1  10
of
2,253