429 search results - page 50 / 86 » Parameter-free polymorphic types |
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
100
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
PLDI
2009
ACM
15 years 6 months ago
2009
ACM
Self-representation – the ability to represent programs in their own language – has important applications in reflective languages and many other domains of programming langu...
ENTCS
2000
14 years 11 months ago
2000
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
210
click to vote
ECOOP
2009
Springer
16 years 14 days ago
2009
Springer
We present a type system for checking object immutability, read-only references, and class immutability in an open or closed world. To allow object initialization outside object co...