Sciweavers

479 search results - page 26 / 96
» Sound and Complete Type Inference for a Systems Programming ...
Sort
View
237
Voted
POPL
2007
ACM
16 years 3 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
179
Voted
POPL
1994
ACM
15 years 6 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
125
Voted
CODES
2004
IEEE
15 years 6 months ago
Facilitating reuse in hardware models with enhanced type inference
High-level hardware modeling is an essential, yet time-consuming, part of system design. However, effective component-based reuse in hardware modeling languages can reduce model c...
Manish Vachharajani, Neil Vachharajani, Sharad Mal...
130
Voted
ECOOP
2011
Springer
14 years 2 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller
123
Voted
ESOP
1992
Springer
15 years 6 months ago
Dynamic Typing
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
Fritz Henglein