3 citations found. Retrieving documents...
Lars Birkedal, Nick Rothwell, Mads Tofte, and David N. Turner. The ML Kit. DIKU, March 1993.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Improving Type-Checkers - Bruce Mcadam   (Correct)

....value is. For example the numeral 1 is typically given type int (integer) An arithmetic expression would also be given the type int (or possibly real if it involves real numbers) In many languages, complex types are built from simpler sub types and type constructors, e.g. the list of numbers [1, 2, 3] would be given type int list built from the type int and the constructor list. The type of a function or procedure is built using a constructor and the types of its domain and range, e.g. the trigonometry sin function would have type real real. Groups of values, know as tuples, have the ....

....converting a natural number constructed from O and SUCC into a normal integer. The Param1 refers to the parameter of the function which is of the form O or SUCC n. functions which forms the basis of many functional programming languages) The second was a modification of the ML Kit compiler [1], a compiler for ML written in ML (an extensive piece of code running to over 30,000 lines long) 3.2.1 Simple Calculus and BigTypes This program was written from scratch though it is based directly on the description of the algorithm W in [2] The program is of no practical use but was the ....

Lars Birkedal, Nick Rothwell, Mads Tofte, and David N. Turner. The ML Kit. DIKU, March 1993.


Debugging Type Errors - Bernstein, Stark (1995)   (15 citations)  (Correct)

....typings for our type definition. A complete proof can be found in the appendix. We feel that our proof has the advantage of being simpler and more straightforward 3 that the one given by Shao and Appel for their algorithm. In Section 4, we discuss our prototype implementation (in the ML Kit [BRTT93]) and in the conclusion we discuss some possible future work. The type inference algorithm for the ML type discipline (Algorithm W) was presented by Damas and Milner in the paper, Principal Type Schemes for Functional Programs [DM82] and was proven correct in Damas PhD dissertation [Dam85] Most ....

Lars Birkedal, Nick Rothwell, Mads Tofte, and David N. Turner. The ML Kit, Version 1, 1993.


Adding BigTypes to ML - Bruce Mcadam   (Correct)

.... 0 (T 1 : and (S 2 ; T 2 ) W 0 (A 0 x [ fx : x g; e 2 ) and w 3 = fx : fT 1 : GammaT 2 :w; fgggT 2 :w and d 3 = T 1 :d [ T 2 :d Gamma (terms about x) in S = S 1 S 2 and T = fT 2 : w 3 ; d 3 g 4 BigTypes in SML BigTypes were implemented in ML by modifying the ML Kit compiler ([1]) BigTypes were only implemented for the core language though the compiler still functions for all ML constructs. It would not be a difficult matter to handle BigTypes for structs (either structures or functors) and they would not play a part in sigs. 4.1 Expanding the Semantics There were ....

Lars Birkedal, Nick Rothwell, Mads Tofte, and David N. Turner. The ML Kit. DIKU, March 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