Proving Theorems about LISP Functions
Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
A Methodology for LISP Program Construction from Examples
Journal of the ACM (JACM)
Communications of the ACM
Lucid, a nonprocedural language with iteration
Communications of the ACM
Inductive methods for proving properties of programs
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Unfold/fold transformations and loop optimization of logic programs
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Detecting static algorithms by partial evaluation
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Deductive and inductive synthesis of equational programs
Journal of Symbolic Computation - Special issue on automatic programming
Abstract interpretation and low-level code optimization
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
From recursion to iteration: what are the optimizations?
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Program Transformation Systems
ACM Computing Surveys (CSUR)
EQUALS – a fast parallel implementation of a lazy language
Journal of Functional Programming
A Multiple-Clause Folding Rule Using Instantiation and Generalization
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
On Computational Creativity, `Inventing' Theorem Proofs
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Theory of linear equations applied to program transformation
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Recursion diagrams: ideas for a geometry of formal methods
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
A Multiple-Clause Folding Rule Using Instantiation and Generalization
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
| Hi-index | 0.00 |