L. Birkedal, N. Rothwell, M. Tofte, and D. N. Turner. The ML Kit Version 1, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Full Lifting of Type Parameters - Minamide (1997) (3 citations) (Correct)
....has a practical advantage for development of compilers as mentioned in [20, 30] When we debug a compiler itself, the code of its intermediate language can be type checked. This has greatly helped to find bugs in our compiler. We have implemented an experimental compiler by using the Kit compiler [2] as a front end. The compiler translates Core Standard ML [19] programs to C. Non parametric operations such let fun f x = let fun g y = x,y) in (g 2, g true) end in f 3; f 3.14 end let val f = t. x:t. let val g = s. y:s. x,y) in (g fintg 2, g fboolg true) end in f fintg 3; f frealg 3.14 end ....
L. Birkedal, N. Rothwell, M. Tofte, and D. N. Turner. The ML Kit Version 1, 1993.
No Type Stamps and No Structure Stamps - a.. - Grosch (1995) (Correct)
....functors are component valued functions and signatures are component specifications. Large systems can be built by successively applying componentvalued functions to previously constructed components. This approach has successfully been used in the development of large software systems [3, 6]. The SML module language can serve as a model for a general module language, independent of the embedded implementation language [27] However, it has some disadvantages: ffl it is not referentially transparent, and ffl programming in the large is not clearly separated from implementing single ....
Lars Birkedal, Nick Rothwell, Mads Tofte, and David N. Turner. The ML Kit version 1. Technical Report 93/14, DIKU, University of Copenhagen, Denmark, 1993.
Compilation Based on a Calculus for Explicit Type Passing - Minamide (1996) (10 citations) (Correct)
....of tuples. By using this facility, closures can be implemented more efficiently. Furthermore, optimization such as uncurrying of type parameter and usual abstractions is more simply formulated than in the previous calculus. We have implemented an experimental compiler by using Kit compiler [2] as front end. The compiler translates Core Standard ML programs to C. Non parametric operations such as polymorphic equality and tag free garbage collection are implemented by using runtime type parameters. As the intermediate language of the compiler, we adopted the language based on calculus ....
Lars Birkedal, Nick Rothwell, Madds Tofte, and David N. Turner. The ML Kit Version 1, 1993.
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