267 search results - page 30 / 54 » Formal Parametric Polymorphism |
124
click to vote
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
124
click to vote
HASKELL
2008
ACM
15 years 3 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
110
click to vote
ICFP
1999
ACM
15 years 6 months ago
1999
ACM
We propose a conservative extension of the polymorphic lambda calculus (A5B ) as an intermediate language for compiling languages with name-based class and interface hierarchies. ...
115
click to vote
ESOP
2000
Springer
15 years 5 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...