1216 search results - page 80 / 244 » Hybrid type checking |
193
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
137
Voted
POPL
1995
ACM
15 years 7 months ago
1995
ACM
Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations eve...
255
Voted
POPL
2007
ACM
16 years 4 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
151
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
140
Voted
POPL
1998
ACM
15 years 7 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...