640 search results - page 17 / 128 » Logical types for untyped languages |
POPL
2006
ACM
14 years 8 months ago
2006
ACM
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
WIESS
2000
13 years 9 months ago
2000
A software system can be called a safe-system with respect to memory, when it supports only strong-typing and it does not allow for the manual disposal of dynamic memory [2]. The ...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
IJFCS
2000
13 years 7 months ago
2000
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...