Inorder traversal of a binary tree and its inversion
Formal development programs and proofs
Program inversion: more than fun!
Science of Computer Programming
On the synthesis of function inverses
Acta Informatica
Real-time deques, multihead Turing machines, and purely functional programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Algebra of programming
Synthesis of functions by transformations and constraints (poster)
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Breadth-first numbering: lessons from a small exercise in algorithm design
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The Science of Programming
Invited Talk: Pointwise Relational Programming
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Elements of a Relational Theory of Datatypes
Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
Proceedings of the Second International Conference on Mathematics of Program Construction
Induction and Recursion on Datatypes
MPC '95 Mathematics of Program Construction
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Algebraic methods for optimization problems
Algebraic and coalgebraic methods in the mathematics of program construction
Journal of Functional Programming
Journal of Functional Programming
Inversion of applicative programs
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Transforming interpreters into inverse interpreters by partial evaluation
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Principles of inverse computation and the Universal resolving algorithm
The essence of computation
Revisiting an automatic program inverter for Lisp
ACM SIGPLAN Notices
Countdown: A case study in origami programming
Journal of Functional Programming
A Method for Automatic Program Inversion Based on LR(0) Parsing
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
An universal resolving algorithm for inverse computation of lazy languages
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
The program inverter LRinv and its structure
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Pointfree factorization of operation refinement
FM'06 Proceedings of the 14th international conference on Formal Methods
A Method for Automatic Program Inversion Based on LR(0) Parsing
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
| Hi-index | 0.00 |
This paper is devoted to the proof and applications of a theorem giving conditions under which the inverse of a partial function can be expressed as a relational hylomorphism. The theorem is a generalisation of a previous result, due to Bird and de Moor, that gave conditions under which a total function can be expressed a relational fold. The theorem is illustrated with three problems, all dealing with constructing trees with various properties.