(Enter summary)
Abstract: We describe a system that supports source-level integration of ML-like functional language
code with ANSI C or Ada83 code. The system works by translating the functional
code into type-correct, "vanilla" C or Ada; it offers simple, efficient, type-safe
inter-operation between new functional code components and "legacy" third-generationlanguage
components. Our translator represents a novel synthesis of techniques including
user-parameterized specification of primitive types and operators;... (Update)
Cited by: More
Faithful Translations between Polyvariant Flows and.. - Amtoft, Turbak (2002)
(Correct)
Inferring Annotated Types for Inter-procedural Register.. - Amtoft, Muller (2002)
(Correct)
On Evaluation Contexts, Continuations, and the Rest of Computation - Danvy
(Correct)
Similar documents (at the sentence level):
76.4%: From ML to Ada(!?!): Strongly-typed Language Interoperability .. - Tolmach, Oliva (1997)
(Correct)
68.9%: From ML to Ada: Strongly-typed Language Interoperability via.. - Tolmach, Oliva (1993)
(Correct)
Active bibliography (related documents): More All
0.5: The Generation of a Higher-Order Online Partial Evaluator - Thiemann, Glück (1995)
(Correct)
0.3: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
0.3: Applicative Programming and Specification - Gilmore (1993)
(Correct)
Similar documents based on text: More All
0.3: A Verified Compiler for Pure PreScheme - Oliva, Wand (1991)
(Correct)
0.2: A Verified Compiler for VLISP PreScheme - Oliva, Ramsdell, Wand (1993)
(Correct)
0.2: Modular Lazy Search for Constraint Satisfaction Problems - Nordin, Tolmach (2001)
(Correct)
Related documents from co-citation: More All
20: Compiling with Continuations (context) - Appel - 1992
17: Flow-directed closure conversion for typed languages
- Cejtin, Jagannathan et al.
14: Design and Implementation of Code Optimizations for a TypeDirected Compiler for .. (context) - Tarditi - 1996
BibTeX entry: (Update)
A. Tolmach and D. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming. (to appear). http://citeseer.ist.psu.edu/article/tolmach93from.html More
@article{ tolmach98from,
author = "Andrew P. Tolmach and Dino Oliva",
title = "From {ML} to Ada: Strongly-Typed Language Interoperability via Source Translation",
journal = "Journal of Functional Programming",
volume = "8",
number = "4",
pages = "367-412",
year = "1998",
url = "citeseer.ist.psu.edu/article/tolmach93from.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
809
A theory of type polymorphism in programming (context) - Milner - 1978
521
Compiling with Continuations (context) - Appel - 1992
220
Orbit: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
210
TIL: A type-directed optimizing compiler for ML
- Tarditi, Morrisett et al. - 1996
210
Implementing lazy functional languages on stock hardware: th..
- Jones - 1992
184
Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
176
Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
167
Garbage collection in an uncooperative environment (context) - Boehm, Weiser - 1988
160
The principal type-scheme of an object in combinatory logic (context) - Hindley - 1969
155
The essence of compiling with continuations
- Flanagan, Sabry et al. - 1993
146
The Glasgow Haskell compiler: a technical overview
- Jones, Hall et al. - 1993
143
Theorems for free
- Wadler - 1989
138
Typed closure conversion
- Minamide, Morrisett et al. - 1996
116
Rabbit: a compiler for Scheme (context) - Steele - 1978
95
Elements of Functional Programming (context) - Reade - 1989
81
The ZINC experiment: an economical implementation of the ML ..
- Leroy - 1991
70
No assembly required: Compiling Standard ML to C
- Tarditi, Lee et al. - 1992
69
Higher-order extensions to PROLOG: are they needed (context) - Warren - 1982
59
Basic polymorphic typechecking
- Cardelli - 1987
58
Simple imperative polymorphism
- Wright - 1995
54
Type Assignment in Programming Languages (context) - Damas - 1984
54
Programming with regions in the ML Kit
- Tofte, Birkedal et al. - 1997
50
ACM Transactions on Programming Languages and Systems (context) - FPCA, SIGPLAN-SIGARCH-WG et al. - 1995
45
Flow-directed inlining
- Jagannathan, Wright - 1996
38
Efficient analyses for realistic off-line partial evaluation (context) - Bondorf, Jorgensen - 1993
37
Compiling with Types (context) - Morrisett - 1995
32
Unify and conquer (context) - Baker - 1990
24
Calculating software generators from solution specifications
- Kieburtz, Bellegarde et al. - 1995
22
Type-driven defunctionalization
- Bell, Bellegarde et al. - 1997
21
Separating stages in the continuation-passing style transfor..
- Lawall, Danvy - 1993
18
Partial evaluation for dictionary-free overloading
- Jones - 1993
18
Green Card: A foreign language interface for Haskell (context) - Jones, Nordin et al. - 1997
18
The Objective Caml System: Documentation and User's Manual (context) - Leroy - 1997
17
Shrinking lambda expressions in linear time
- Appel, Jim - 1998
17
The templates approach to software reuse (context) - Volpano, Kieburtz - 1989
16
An implementation of Reynold's defunctionalization method fo.. (context) - Bell - 1994
16
A correspondence between continuation passing style and stat..
- Kelsey - 1995
15
Continuation-passing (context) - Appel, Jim - 1989
14
Software templates (context) - Volpano, Kieburtz - 1985
11
Compilation by transformation: A report from the trenches (context) - Jones - 1996
10
An optimizing ML to C compiler
- Cridlig - 1992
9
Combining closure conversion with closure analysis using alg..
- Tolmach - 1997
5
An efficient way of compiling ML to C (context) - Chailloux - 1992
4
Polymorphic type (context) - Talpin, Jouvelot - 1992
2
Region-based memory management (context) - to, Tofte et al. - 1997
2
Substitution: A formal methods case study using monads and t.. (context) - to, Bellegarde et al. - 1994
2
A higher order removal method (context) - Chin, Darlington - 1996
1
Compiling a higher-order call-by-value functional programmin.. (context) - TAPSOFT', of et al. - 1996
1
interface for Standard ML of New Jersey (context) - Math, -- et al. - 1996
1
Design and Implementation of Code Optimizations for a Type-D.. (context) - Functional, -- - 1996
1
Replacing function parameters by global variables (context) - National, pages et al. - 1988
1
Automatic autoprojection of higher order recursive equations (context) - Experience, Bondorf - 1990
1
Unboxed object and polymorphic typing (context) - Report, Tolmach et al. - 1992
1
Compiling a functional language (context) - Functional, -- - 1984
1
Available as TR CMU-CS (context) - TR, Morrisett et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.pdx.edu/~apt/): More
Combining Closure Conversion with Closure Analysis using.. - Tolmach (1997)
(Correct)
Typed Higher-order Narrowing without Higher-order Strategies - Sergio Antoy (1999)
(Correct)
Building Program Optimizers with Rewriting Strategies - Visser, Benaissa, Tolmach (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC