24 search results - page 1 / 5 » Binding-Time Analysis for Standard ML |
PEPM
1994
ACM
13 years 9 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
ICFP
2000
ACM
13 years 9 months ago
2000
ACM
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...
ICDAR
2007
IEEE
13 years 11 months ago
2007
IEEE
As pen-based computing becomes more prevalent, it is increasingly important to be able to share ink across applications and across platforms. The emerging standard Ink Markup Lang...
POPL
1990
ACM
13 years 8 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
FDL
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract. With this paper we intend to present a brief overview of the current means to describe architecture in different standards. We cover AADL as an example of Architecture De...