Worker/Wrapper Transformation

MaRDI QIDQ41248swMATHFDO

Authors Peter Gammie

Publication date 30 October 2009

Official website https://www.isa-afp.org/entries/WorkerWrapper.html

Cites work

• A Purely Definitional Universal Domain
• A Transformation System for Developing Recursive Programs
• A unifying approach to goal-directed evaluation
• Automata, languages and programming. 2nd colloquium, University of Saarbrücken, July 29-August 2, 1974
• Comprehending monads
• Data Refinement
• Data Types as Lattices
• Factorising folds for faster functions
• Functional and logic programming. 4th Fuji international symposium, FLOPS '99, Tsukuba, Japan, November 11--13, 1999. Proceedings
• HOLCF = HOL + LCF
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• On folk theorems
• Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
• Programming languages and their definition. Selected papers ed. by C. B. Jones
• Relating models of backtracking
• Relational properties of domains
• Short note: Strict unwraps make worker/wrapper fusion totally correct
• The worker/wrapper transformation
• Theorem proving in higher order logics. 22nd international conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings
• Theory of program structures: Schemes, semantics, verification

Cited in

(1)

• Automated Reasoning in Higher-Order Regular Algebra

This page was built for software: Worker/Wrapper Transformation