The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Essence of generalized partial computation
Theoretical Computer Science - Images of programming dedicated to the memory of Andrei P. Ershov
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
An introduction to partial evaluation
ACM Computing Surveys (CSUR)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Improving programs by the introduction of recursion
Communications of the ACM
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Automatic generation of efficient string matching algorithms by generalized partial computation
ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation
Concrete Math
Program transformation system based on generalized partial computation
New Generation Computing - Partial evaluation and program transformation
Partial Evaluation of Computation Process, Revisited
Higher-Order and Symbolic Computation
Partial Evaluation of Computation Process—AnApproach to a Compiler-Compiler
Higher-Order and Symbolic Computation
Selected Papers from the Internaltional Seminar on Partial Evaluation
Selected Papers from the Internaltional Seminar on Partial Evaluation
REDUCE - A Case Study in Algebra System Development
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree
WSA '93 Proceedings of the Third International Workshop on Static Analysis
An investigation of Jones optimality and BTI-universal specializers
Higher-Order and Symbolic Computation
Is there a fourth Futamura projection?
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
An experiment with the fourth futamura projection
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
POET: a scripting language for applying parameterized source-to-source program transformations
Software—Practice & Experience
| Hi-index | 0.00 |
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.