277 search results - page 21 / 56 » A First-Order Theory of Types and Polymorphism in Logic Prog... |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
PLDI
2005
ACM
14 years 1 months ago
2005
ACM
Today’s module systems do not effectively support information hiding in the presence of shared mutable objects, causing serious problems in the development and evolution of larg...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
TLDI
2003
ACM
14 years 27 days ago
2003
ACM
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set ...