Results 271 to 280 of about 9,195,846 (282)
Some of the next articles are maybe not open access.
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
Abstract types have existential types
Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85, 1985Abstract data type declarations appear in typed programming languages like Ada, Alphard, CLU and ML. This form of declaration binds a list of identifiers to a type with associated operations, a composite “value” we call a data algebra . We use a second-order typed lambda calculus SOL to show how data algebras may be
John C. Mitchell, Gordon D. Plotkin
openaire +2 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
Type inference and type classes
1990Type classes were developed in association with the lazy functional programming language Haskell [1] to handle overloading since no satisfactory off-the-shelf solution was available. The motivation and description of type classes is given in [2].
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 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++: 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
Principal typings and type inference.
1996Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996. ; Includes bibliographical references (p. 115-120) and index. ; by Trevor Jim. ; Ph.D.
openaire +1 more source