7529 search results - page 15 / 1506 » The Modula-3 Type System |
ENTCS
2002
13 years 7 months ago
2002
We show that the basic feasible functions of Cook and Urquhart's BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type i...
ENTCS
2002
13 years 7 months ago
2002
The HM(X) framework is a constraint-based type framework with built-in letpolymorphism. This paper establishes purely syntactic type soundness for the framework, treating an exten...
ENTCS
2002
13 years 7 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
ISSTA
2012
ACM
11 years 10 months ago
2012
ACM
Multithreaded programs are notoriously prone to unintended interference between concurrent threads. To address this problem, we argue that yield annotations in the source code sho...
CACM
1998
13 years 7 months ago
1998
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...