🚀 go-pugleaf

Hello,

This is (once again, others did earlier) a query about program
transformation, this time in the context of their application in
extended compilation (as Feather [1] defines: compilation with
programmer advice). Does anyone applies the techniques as f.i.
described in the Partsch Book "Specification and Transformation of
Programs" [2] for fully or nearly-full automated compilation?

* Function composition
* Function combination
* Partial evaluation & mixed computation
* Differencing
* Recursion simplification

I'am in particular interested in calculi which allow to express and
drive transformation process and applicatability condition check 
in a single integrated framework, like f.i. the RAINBOW II component
of the KIDS transformation system shall be (I'am not sure if it does,
I have no reference for it, but it is mentioned in [3]).

Papers, Projects, Desasters? I will be glad to summarize.

Thank You in advance
Wolfgang Grieskamp


[1]	M.S.Feather. A Survey and Classification of Program
	Transformation Approaches and Techniques. In: Programm
	Specification and Transformation, L.G.L.T. Meertens (Editor), 
	North Holland, 1987.

[2]	H.Partsch. Specification and Transformation of Programs.
	Springer, 1990.
	
[3]	KIDS: A Semiautomatic Program Development System. IEEE
	Transactions on Software Engineering, Vol. 16, No. 9,
	September 1990.


--
Wolfgang Grieskamp  wg@cs.tu-berlin.de tub!tubopal!wg  wg%opal@DB0TUI11.BITNET