3827 search results - page 477 / 766 » The Epsilon Generation Language |
171
click to vote
ECOOP
1997
Springer
15 years 11 months ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
208
click to vote
PEPM
1993
ACM
15 years 11 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
228
click to vote
POPL
1993
ACM
15 years 11 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
168
click to vote
IWMM
2010
Springer
15 years 10 months ago
2010
Springer
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...
189
click to vote
ESOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...