contification paper outline

[Stephen Weeks]

Following up on my previous email, here is a propsed outline of the paper.

intro
MLton and CPS IL
	mention appel - SSA is functional programming
	grammar
	type system
contification
	motivation 
		mention kelsey, patent 
		optimizations
	framework
		A in Analysis = ...
		A is cyclic if ...
		A is safe if ...
		A is minimal if ...
	transformation
analyses
	trivial	-- A(f) = Unknown
	almost as trivial -- A(f) = Unknown if Reach(f), else A(f) = Uncalled
	call
	cont
		cite reppy
		mention differences due to all known calls
	both
	dom
		proof of minimality
benchmarks
	compare none, call, cont, both, dom.
	static counts of contified funs
	running times
	compile times
		total compile time
		% total compile time spent in contification
	code sizes, or just say no significant difference
extensions
	A*/parent