Related articles |
---|
Reconstructing the Types of Stack-Machine Codes cookcu@ruby.kaist.ac.kr (Oukseh Lee) (1998-10-17) |
Re: Reconstructing the Types of Stack-Machine Codes anton@mips.complang.tuwien.ac.at (1998-10-18) |
Re: Reconstructing the Types of Stack-Machine Codes M-Jourdan@calva.net (1998-10-18) |
Re: Reconstructing the Types of Stack-Machine Codes andrewf@slhosiery.com.au (Andrew Fry) (1998-10-18) |
Re: Reconstructing the Types of Stack-Machine Codes cwm2n@cobra.cs.virginia.edu (Christopher W. Milner) (1998-10-21) |
Re: Reconstructing the Types of Stack-Machine Codes kers@hplb.hpl.hp.com (1998-10-24) |
Re: Reconstructing the Types of Stack-Machine Codes Jan.Vitek@cui.unige.ch (1998-10-30) |
From: | "Christopher W. Milner" <cwm2n@cobra.cs.virginia.edu> |
Newsgroups: | comp.compilers |
Date: | 21 Oct 1998 01:39:02 -0400 |
Organization: | University of Virginia |
References: | 98-10-104 |
Keywords: | types, analysis |
> Whoever knows about TYPE ANALYSIS of STACK-MACHINE CODES?
Again, this might be overkill, but you might look at the typed
assembly language (TAL) of Morrisett at Cornell. He uses type
information to generate efficient code.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.