Results 271 to 280 of about 139,845,986 (286)
Some of the next articles are maybe not open access.
Typed equivalence, type assignment, and type containment
1991The study of models based on partial equivalence relations (per) and the analysis of the interpretation of inheritance that arises in these structures (Bruce&Longo[88]) leads us to reconsider the classical problem of type-assignment in this framework.
openaire +2 more sources
Types of evaluation and types of evaluator
Evaluation Practice, 1996In response to the previous papers, Scriven defends the formative/ summative dichotomy as one reasonable way (of several possible ways) to classify evaluation activities. He argues that context ultimately ascribes to evaluation activities their formative or summative function, and clarifies areas of agreement and disagreement with authors Chen, Patton,
openaire +1 more source
Dynamic typing in a statically typed language
ACM Transactions on Programming Languages and Systems, 1989Statically typed programming languages allow earlier error checking, better enforcement of diciplined programming styles, and the generation of more efficient object code than languages where all type consistency checks are performed at run time.
Martín Abadi +3 more
openaire +2 more sources
Type inference and type containment
1984Type inference, the process of assigning types to untyped expressions, may be motivated by the design of a typed language or semantical considerations on the meanings of types and expressions. A typed language GR with polymorphic functions leads to the GR inference rules.
openaire +1 more source
Type classes with existential types
Journal of Functional Programming, 1996Abstract We argue that the novel combination of type classes and existential types in a single language yields significant expressive power. We explore this combination in the context of higher-order functional languages with static typing, parametric polymorphism, algebraic data types and Hindley–Milner type inference.
openaire +2 more sources
1995
The purpose of this paper is threefold. First, we describe some basic ideas of constructive type theory, with emphasis on their value for specification. Second, we demonstrate the use of type theory as a specification language. This is done by means of a detailed example, namely, the specification of an abstract data type (ADT) for multisets.
openaire +1 more source
The purpose of this paper is threefold. First, we describe some basic ideas of constructive type theory, with emphasis on their value for specification. Second, we demonstrate the use of type theory as a specification language. This is done by means of a detailed example, namely, the specification of an abstract data type (ADT) for multisets.
openaire +1 more source
HLA-B27: To Type or Not to Type?
Annals of Internal Medicine, 1980The association between the histocompatibility antigen HLA-B27 and the seronegative spondylarthritides such as ankylosing spondylitis and Reiter's syndrome is dramatic. A question that arises in practice is, when should a clinician request HLA-B27 typing in the assessment of a patient with a rheumatologic complaint?
openaire +2 more sources
Type of search by type of library
Information Processing & Management, 1979Abstract This is a summary of the literature on users studies from a particular point of view that is convenient for specialists to refer to, and informative for non-specialists. Variation in type of search may be considered central to providing a rational explanation and justification of the variations in resource allocation in different types of ...
openaire +2 more sources
type++: Prohibiting Type Confusion with Inline Type Information
Proceedings 2025 Network and Distributed System Security SymposiumType confusion, or bad casting, is a common C++ attack vector. Such vulnerabilities cause a program to interpret an object as belonging to a different type, enabling powerful attacks, like control-flow hijacking. C++ limits runtime checks to polymorphic classes because only those have inline type information.
Badoux, Nicolas +3 more
openaire +3 more sources
1997
We present two mutual encodings, respectively of the Calculus of Inductive Constructions in Zermelo-Fraenkel set theory and the opposite way. More precisely, we actually construct two families of encodings, relating the number of universes in the type theory with the number of inaccessible cardinals in the set theory.
openaire +1 more source
We present two mutual encodings, respectively of the Calculus of Inductive Constructions in Zermelo-Fraenkel set theory and the opposite way. More precisely, we actually construct two families of encodings, relating the number of universes in the type theory with the number of inaccessible cardinals in the set theory.
openaire +1 more source