2880 search results - page 116 / 576 » Types are calling conventions |
174
click to vote
INTERSENSE
2006
ACM
16 years 2 days ago
2006
ACM
— Pervasive computing applications typically involve rich interactions and heterogeneous network types; e.g. involving the collation of data from a sensor network into a replicat...
142
click to vote
TLCA
2005
Springer
15 years 11 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
151
click to vote
ISSTA
2004
ACM
15 years 11 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
174
click to vote
POPL
1998
ACM
15 years 10 months ago
1998
ACM
Previously, we developed a type system to ensure secure information flow in a sequential, imperative programming language [VSI96]. Program variables are classified as either hig...
171
Voted
DBPL
1993
Springer
15 years 10 months ago
1993
Springer
A class of database programs exist which are required to operate over an infinite number of types; included in this class are object browsers and query tools. The types over which...