Content deleted Content added
Citation bot (talk | contribs) m Alter: isbn. | You can use this bot yourself. Report bugs here.| Activated by User:Headbomb |
m linking |
||
Line 61:
</ref>
This extended lambda calculus was intended to serve as a provably memory-safe [[intermediate representation]] for compiling Standard ML programs into machine code, but building a translator that would produce good results on large programs faced a number of practical limitations which had to be resolved with new analyses, including dealing with recursive calls, [[tail recursion|tail recursive]] calls, and eliminating regions which contained only a single value. This work was completed in 1995<ref>
{{cite conference |url=http://portal.acm.org/citation.cfm?id=237721.237771 |title=From region inference to von Neumann machines via region representation inference |last1=Birkedal |first1=Lars |authorlink1=Lars Birkedal |last2=Tofte |first2=Mads |authorlink2=Mads Tofte |last3=Vejlstrup |first3=Magnus |authorlink3=Magnus Vejlstrup |year=1996 |booktitle=POPL '96: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages |publisher=ACM |accessdate=22 February 2010 |pages=171–183 |___location=New York, NY, USA |isbn=0-89791-769-3 |doi=10.1145/237721.237771}}
</ref> and integrated into the ML Kit, a version of ML based on region allocation in place of garbage collection. This permitted a direct comparison between the two on medium-sized test programs, yielding widely varying results ("between 10 times faster and four times slower") depending on how "region-friendly" the program was; compile times, however, were on the order of minutes.<ref>
| |||