Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
364
Typed closure conversion
- IN PROCEEDINGS OF THE 23TH SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES (POPL
, 1996
"... The views and conclusions contained in this document are those of the authors and should not be interpreted as representing official policies, either expressed or implied, of the Advanced Research Projects Agency or the U.S. Government. Any opinions, findings, and conclusions or recommendations expr ..."
Abstract
-
Cited by 150 (18 self)
- Add to MetaCart
expressed in this material are those of the We study the typing properties of closure conversion for simply-typed and polymorphic-calculi. Unlike most accounts of closure conversion, which only treat the untyped-calculus, we translate well-typed source programs to well-typed target programs. This allows
Object Closure Conversion
- In Electronic Notes in Theoretical Computer Science
, 1999
"... An integral part of implementing functional languages is closure conversion---the process of converting code with free variables into closed code and auxiliary data structures. Closure conversion has been extensively studied in this context, but also arises in languages with first-class objects. In ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
An integral part of implementing functional languages is closure conversion---the process of converting code with free variables into closed code and auxiliary data structures. Closure conversion has been extensively studied in this context, but also arises in languages with first-class objects
Type Systems for Closure Conversions
- In The Workshop on Types for Program Analysis
, 1995
"... . We consider the problem of analyzing and proving correct simple closure conversion strategies for a higher-order functional language. We specify the conversions as deductive systems, making use of annotated types to provide constraints which guide the construction of the closures. We exploit the a ..."
Abstract
-
Cited by 23 (0 self)
- Add to MetaCart
. We consider the problem of analyzing and proving correct simple closure conversion strategies for a higher-order functional language. We specify the conversions as deductive systems, making use of annotated types to provide constraints which guide the construction of the closures. We exploit
Correct Separate and Selective Closure Conversion
"... We describe how to separately analyze a program context and a term substitution in an untyped higher-order language, in order to perform selective closure conversion. Each node of the parse trees for the context and the substitution is annotated by solving constraints; the solutions may be considere ..."
Abstract
- Add to MetaCart
We describe how to separately analyze a program context and a term substitution in an untyped higher-order language, in order to perform selective closure conversion. Each node of the parse trees for the context and the substitution is annotated by solving constraints; the solutions may
Flow-Directed Lightweight Closure Conversion
, 1999
"... procedures contain single concrete procedures when the procedure has no closure-pointer slot, due to closure-pointer{slot elimination, as described below. Furthermore, the concrete aggregate objects in abstract aggregate objects such as pairs, strings, vectors, symbols, continuations, and procedures ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
circumstances that require a must-alias property to hold. The method used by Stalin to approximate this must-alias property is the crux of the lightweight closure-conversion process and is described in detail in section 3.12. Experiments reported in section 4 show that closure-pointer{slot elimination
Flow-Directed Closure Conversion for Typed Languages
- In ESOP '00 [ESOP00
, 2000
"... This paper presents a new closure conversion algorithm for simply-typed languages. We have have implemented the algorithm as part of MLton, a whole-program compiler for Standard ML (SML). MLton first applies all functors and eliminates polymorphism by code duplication to produce a simply-typed progr ..."
Abstract
-
Cited by 43 (1 self)
- Add to MetaCart
This paper presents a new closure conversion algorithm for simply-typed languages. We have have implemented the algorithm as part of MLton, a whole-program compiler for Standard ML (SML). MLton first applies all functors and eliminates polymorphism by code duplication to produce a simply
Typed closure conversion preserves observational equivalence
, 2008
"... Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different language, this is true only if the translation process preserves observational equivalence. We investigate the problem of fully ..."
Abstract
-
Cited by 21 (6 self)
- Add to MetaCart
abstract compilation, i.e., compilation that both preserves and reflects observational equivalence. In particular, we prove that typed closure conversion for the polymorphic λ-calculus with existential and recursive types is fully abstract. Our proof uses operational techniques in the form of a step
A Categorical and Graphical Treatment of Closure Conversion
- In Proc. MFPS 15
, 1998
"... This paper gives a formal basis for the closure conversion phase of functional programming languages with imperative features, using a graphical semantics for the language. We present normal forms of graphs, one corresponding to procedural languages, and one corresponding to object-oriented language ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
This paper gives a formal basis for the closure conversion phase of functional programming languages with imperative features, using a graphical semantics for the language. We present normal forms of graphs, one corresponding to procedural languages, and one corresponding to object
Results 1 - 10
of
364
