Sciweavers

98 search results - page 3 / 20
» Binding-Time Analysis for Polymorphic Types
Sort
View
99
Voted
ICFP
2010
ACM
15 years 3 months ago
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
Stefan Holdermans, Jurriaan Hage
126
Voted
POPL
1995
ACM
15 years 6 months ago
Compiling Polymorphism Using Intensional Type Analysis
Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations eve...
Robert Harper, J. Gregory Morrisett
CASSIS
2005
Springer
15 years 8 months ago
Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks
Abstract. We study secure information flow in a stack based Typed Assembly Language (TAL). We define a TAL with an execution stack and establish the soundness of its type system ...
Eduardo Bonelli, Adriana B. Compagnoni, Ricardo Me...
OOPSLA
2005
Springer
15 years 8 months ago
Parametric polymorphism for software component architectures
Parametric polymorphism has become a common feature of mainstream programming languages, but software component architectures have lagged behind and do not support it. We examine ...
Cosmin E. Oancea, Stephen M. Watt
149
Voted
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
15 years 6 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen