Once upon a polymorphic type
K Wansbrough, S Peyton Jones - … of the 26th ACM SIGPLAN-SIGACT …, 1999 - dl.acm.org
We present a sound type-based'usage analysis' for a realistic lazy functional language.
Accurate information on the usage of program subexpressions in a lazy functional language …
Accurate information on the usage of program subexpressions in a lazy functional language …
Subtyping dependent types
D Aspinall, A Compagnoni - Proceedings 11th Annual IEEE …, 1996 - ieeexplore.ieee.org
The need for subtyping in type-systems with dependent types has been realized for some
years. But it is hard to prove that systems combining the two features have fundamental …
years. But it is hard to prove that systems combining the two features have fundamental …
A calculus for uniform feature composition
S Apel, D Hutchins - ACM Transactions on Programming Languages …, 2008 - dl.acm.org
The goal of feature-oriented programming (FOP) is to modularize software systems in terms
of features. A feature refines the content of a base program. Both base programs and …
of features. A feature refines the content of a base program. Both base programs and …
Subtyping dependent types
D Aspinall, A Compagnoni - Theoretical Computer Science, 2001 - Elsevier
The need for subtyping in type systems with dependent types has been realized for some
years. But it is hard to prove that systems combining the two features have fundamental …
years. But it is hard to prove that systems combining the two features have fundamental …
[PDF][PDF] Polarized higher-order subtyping.
M Steffen - 1999 - Citeseer
The calculus of higher order subtyping, known as F ω≤, a higher-order polymorphic λ-
calculus with subtyping, is expressive enough to serve as core calculus for typed object …
calculus with subtyping, is expressive enough to serve as core calculus for typed object …
On subtyping and matching
M Abadi, L Cardelli - European Conference on Object-Oriented …, 1995 - Springer
A relation between recursive object types, called matching, has been proposed as a
generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it …
generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it …
Positive subtyping
M Hofmann, B Pierce - Proceedings of the 22nd ACM SIGPLAN-SIGACT …, 1995 - dl.acm.org
The statement S≤ T in a λ-calculus with subtyping is traditionally interpreted by a semantic
coercion function of type [[S]]→[[T]] that extracts the “T part” of an element of S. If the …
coercion function of type [[S]]→[[T]] that extracts the “T part” of an element of S. If the …
Typed operational semantics for higher-order subtyping
A Compagnoni, H Goguen - Information and Computation, 2003 - Elsevier
Bounded operator abstraction is a language construct relevant to object oriented
programming languages and to ML2000, the successor to Standard ML. In this paper, we …
programming languages and to ML2000, the successor to Standard ML. In this paper, we …
A unifying type-theoretic framework for objects
M Hofmann, B Pierce - Journal of Functional Programming, 1995 - cambridge.org
We give a direct type-theoretic characterization of the basic mechanisms of object-oriented
programming, including objects, methods, message passing, and subtyping, by introducing …
programming, including objects, methods, message passing, and subtyping, by introducing …
[图书][B] Higher-order subtyping with intersection types
AB Compagnoni - 1995 - repository.ubn.ru.nl
One of the basic ideas in programming is the notion of algorithm. An algorithm is a
description of the rules one must follow to accomplish a task. But for a machine to be able to …
description of the rules one must follow to accomplish a task. But for a machine to be able to …