WSDFU: Program transformation system based on generalized partial computation. Generalized Partial Computation (GPC) is a program transformation method utilizing partial information about input data and auxiliary functions as well as the logical structure of a source program. GPC uses both an inference engine such as a theorem prover and a classical partial evaluator to optimize programs. Therefore, GPC is more powerful than classical partial evaluators but harder to implement and control. We have implemented an experimental GPC system called WSDFU (Waseda Simplify-Distribute-Fold-Unfold). This paper demonstrates the power of the program transformation system as well as its theorem prover and discusses some future works.
Keywords for this software
References in zbMATH (referenced in 8 articles , 1 standard article )
Showing results 1 to 8 of 8.
- Glück, Robert: An experiment with the fourth Futamura projection (2010)
- Jonsson, Peter A.; Nordlander, Johan: Positive supercompilation for a higher-order call-by-value language (2010)
- Glück, Robert: An investigation of Jones optimality and BTI-universal specializers (2008)
- Amtoft, Torben; Consel, Charles; Danvy, Olivier; Malmkjær, Karoline: The abstraction and instantiation of string-matching programs (2002)
- Futamura, Yoshihiko; Konishi, Zenjiro; Glück, Robert: WSDFU: Program transformation system based on generalized partial computation (2002)
- Futamura, Yoshihiko; Konishi, Zenjiro; Glück, Robert: Program transformation system based on generalized partial computation (2002)
- Kamin, Sam; Callahan, Miranda; Clausen, Lars: Lightweight and generative components. II: Binary-level components (2000)
- Song, Litong; Futamura, Yoshihiko: A new termination approach for specialization (2000)