Static dependent types for first class modules
MA Sheldon, DK Gifford - Proceedings of the 1990 ACM Conference on …, 1990 - dl.acm.org
Static dependent types are the basis of a new type system that permits types and values to
be packaged together into first class modules. Unlike other approaches to modules, static …
be packaged together into first class modules. Unlike other approaches to modules, static …
A unified system of type refinements
J Dunfield - 2007 - search.proquest.com
Abstract Types express properties of programs; typechecking is specification checking.
However, the specifications expressed by types in conventional type systems are imprecise …
However, the specifications expressed by types in conventional type systems are imprecise …
Constrained kinds
O Tardieu, N Nystrom, I Peshansky… - Proceedings of the ACM …, 2012 - dl.acm.org
Modern object-oriented languages such as X10 require a rich framework for types capable
of expressing both value-dependency and genericity, and supporting pluggable, domain …
of expressing both value-dependency and genericity, and supporting pluggable, domain …
Types that reflect changes of object usability
F Puntigam - Joint Modular Languages Conference, 1997 - Springer
Strong, static typing is useful because it can improve the readability, reliability and
optimizability of programs. The usability of an object may change over time. However …
optimizability of programs. The usability of an object may change over time. However …
Applied type system
H Xi - International Workshop on Types for Proofs and …, 2003 - Springer
Abstract The framework Pure Type System (PTS) offers a simple and general approach to
designing and formalizing type systems. However, in the presence of dependent types, there …
designing and formalizing type systems. However, in the presence of dependent types, there …
[PDF][PDF] Refinement types for ML
T Freeman, F Pfenning - Proceedings of the ACM SIGPLAN 1991 …, 1991 - dl.acm.org
T $'e describe a refinement of ML's type system allowing the specification of recursively
defined subtypes of user-defined datatypes. The resulting system of rejirzemeni f, ypes …
defined subtypes of user-defined datatypes. The resulting system of rejirzemeni f, ypes …
Faking it simulating dependent types in haskell
C McBride - Journal of functional programming, 2002 - cambridge.org
Dependent types reflect the fact that validity of data is often a relative notion by allowing prior
data to affect the types of subsequent data. Not only does this make for a precise type …
data to affect the types of subsequent data. Not only does this make for a precise type …
[PDF][PDF] Nested types
M Odersky, C Zenger - 8th Workshop on Foundations of Object-Oriented …, 2001 - Citeseer
We currently see a convergence of module systems and type systems for object-oriented
programming. This convergence is driven by the demands of large scale component …
programming. This convergence is driven by the demands of large scale component …
Practical polymorphism
RS Nikhil - … on Functional Programming Languages and Computer …, 1985 - Springer
Polymorphic type systems as proposed by Milner and implemented in the programming
language ML offer rich types, unobtrusive compile-time type-checking and complete type …
language ML offer rich types, unobtrusive compile-time type-checking and complete type …
[PDF][PDF] Resourceful dependent types
A Abel - 24th International Conference on Types for Proofs and …, 2018 - types2018.projj.eu
Quantitative typing integrates resource usage tracking into the type system. The prime
example is linear lambda-calculus that requires that each variable is used exactly once …
example is linear lambda-calculus that requires that each variable is used exactly once …