4770 search results - page 328 / 954 » Flexible Type Analysis |
166
Voted
TLCA
2005
Springer
16 years 28 days 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...
192
Voted
ISSTA
2004
ACM
16 years 27 days 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...
213
click to vote
OOPSLA
2004
Springer
16 years 24 days ago
2004
Springer
This paper presents the design of G, a new language specifically created for generic programming. We review and identify important language features of C++ and Haskell in light o...
216
click to vote
POPL
1998
ACM
15 years 11 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...
259
click to vote
DILS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Ecologists spend considerable effort integrating heterogeneous data for statistical analyses and simulations, for example, to run and test predictive models. Our research...