PageName ▼	Summary + Labels ▼	Changed ▼	ChangedBy ▼	...
	GettingStartedWeb	Getting started with SPSC web application (obsolete)   Featured	Mar 2010	sergei.r...@gmail.com
	SampleEqTheSame	SPSC "proves the theorem" that "X=X cannot be false".	Mar 2010	sergei.r...@gmail.com
	SampleMember	Supercompiled programs may be "flatter" than the original ones.	Mar 2010	sergei.r...@gmail.com
	SampleMemberFirstArg	The member function specialized with respect to the 1st argument.	Mar 2010	sergei.r...@gmail.com
	SampleMemberSecondArg	The member function specialized with respect to the 2nd argument.	Mar 2010	sergei.r...@gmail.com
	SampleNotOrNot	Eliminating control structures.	Mar 2010	sergei.r...@gmail.com
	SampleTasks	Sample tasks for SPSC.   Featured	Mar 2010	sergei.r...@gmail.com
	SimpleLazyFirstOrderLanguage	The language dealt with by the Small Positive Supercompiler.   Featured	Mar 2010	sergei.r...@gmail.com
	TableOfContents	SPSC Table of Contents	Mar 2010	sergei.r...@gmail.com
	GettingStarted	How to Launch SPSC   Featured	Mar 2010	sergei.r...@gmail.com
	SampleAbAb	Transforming a 2-pass algorithm to a 1-pass one	Mar 2010	sergei.r...@gmail.com
	SampleAppendAppend	Transforming a 2-pass algorithm to a 1-pass one for binary functions.	Mar 2010	sergei.r...@gmail.com
	SampleEq2	Transforming a binary function into a unary one.	Mar 2010	sergei.r...@gmail.com