98 search results - page 6 / 20 » Binding-Time Analysis for Polymorphic Types |
LFCS
1992
Springer
14 years 13 days ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
APLAS
2008
ACM
13 years 10 months ago
2008
ACM
This paper introduces a new type system designed for safe systems programming. The type system features a new mutability model that combines unboxed types with a consistent typing ...
DLS
2005
13 years 10 months ago
2005
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
FPCA
1989
14 years 13 days ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
ICFP
2000
ACM
13 years 12 months ago
2000
ACM
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...