Journal of the ACM Bibliography

Selected papers that cite this one

• James Andrews. A logical semantics for depth-first Prolog with ground negation. Theoretical Computer Science, 184(1-2):105-143, 30 September 1997.

• Zena M. Ariola and Jan Willem Klop. Lambda calculus with explicit recursion. Information and Computation, 139(2):154-233, 15 December 1997.

• François Bellegarde and James Hook. Subsitution: A formal methods case study using monads and transformations. Science of Computer Programming, 23(2-3):287-311, December 1994.

• N. Bensaou and I. Guessarian. Transforming constraint logic programs. Theoretical Computer Science, 206(1-2):81-125, 6 October 1998.

• Rudolf Berghammer and Burghard von Karger. Towards a design calculus for CSP. Science of Computer Programming, 26(1-3):99-115, May 1996.

• Bard Bloom and Robert Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming, 24(3):189-220, June 1995.

• Eerke A. Boiten. Improving recursive functions by inverting the order of evaluation. Science of Computer Programming, 18(2):139-179, April 1992.

• Wei-Ngan Chin. Safe fusion of functional expressions II: Further improvements. Journal of Functional Programming, 4(4):515-555, October 1994.

• Wei-Ngan Chin and Masami Hagiya. A bounds inference method for vector-based memoization. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 176-187, Amsterdam, The Netherlands, 9-11 June 1997.

• Sandro Etalle and Maurizio Gabbrielli. Transformations of CLP modules. Theoretical Computer Science, 166(1-2):101-146, 20 October 1996.

• Stephen Fitzpatrick, Terence J. Harmer, Alan Stewart, Maurice Clint, and James M. Boyle. The automated transformation of abstract specifications of numerical algorithms into efficient array processor implementations. Science of Computer Programming, 28(1):1-41, January 1997.

• Thomas F. Gritzner and Rudolf Berghammer. A relation algebraic model of robust correctness. Theoretical Computer Science, 159(2):245-270, 3 June 1996.

• Peter G. Harrison and R. Lyndon While. Transformation of polynomial evaluation to a pipeline via Horner's rule. Science of Computer Programming, 24(1):83-95, February 1995.

• Martin C. Henson. An intensional semantics for elementary program transformations. Journal of Logic and Computation, 5(4):423-447, August 1995.

• Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, and Akihiko Takano. Tupling calculation eliminates multiple data transversals. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 164-175, Amsterdam, The Netherlands, 9-11 June 1997.

• Björn Lisper. Computing in unpredictable environments: semantics, reduction strategies, and program transformations. Theoretical Computer Science, 190(1):61-85, 10 January 1998.

• Björn Lisper. Total unfolding: theory and applications. Journal of Functional Programming, 4(4):479-498, October 1994.

• Yanhong A. Liu, Scott D. Stoller, and Tim Teitelbaum. Discovering auxiliary information for incremental computation. In Conference Record of POPL '96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 157-170, St. Petersburg Beach, Florida, 21-24 January 1996.

• Yanhong A. Liu and Tim Teitelbaum. Systematic derivation of incremental programs. Science of Computer Programming, 24(1):1-39, February 1995.

• Ian Mackie. Lilac: a functional programming language based on linear logic. Journal of Functional Programming, 4(4):395-433, October 1994.

• Bernhard Möller and Martin Russling. Shorter paths to graph algorithms. Science of Computer Programming, 22(1-2):157-180, April 1994.

• Cristóbal Pareja-Flores and J. Ángel Velázquez-Iturbide. Synthesis of functions by transformations and constraints. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, page 317, Amsterdam, The Netherlands, 9-11 June 1997.

• Alberto Pettorossi, Maurizio Proietti, and Sophie Renault. Reducing nondeterminism while specializing logic programs. In Conference Record of POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 414-427, Paris, France, 15-17 January 1997.

• David Sands. A naïve time analysis and its theory of cost equivalence. Journal of Logic and Computation, 5(4):495-541, August 1995.

• David Sands. Proving the correctness of recursion-based automatic program transformations. Theoretical Computer Science, 167(1-2):193-233, 30 October 1996.

• H. Seidl and M. H. Sørensen. Constraints to stop higher-order deforestation. In Conference Record of POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 400-413, Paris, France, 15-17 January 1997.

• H. Seidl and M. H. Sørensen. Constraints to stop deforestation. Science of Computer Programming, 32(1-3):73-107, September 1998.

• J. C. Shepherdson. Unfold/fold transformations of logic programs. Mathematical Structures in Computer Science, 2(2):143-157, June 1992.

• F. Vivarès. Modelling Jackson's programming method. Science of Computer Programming, 20(3):173-204, June 1993.

• William G Vree and Pieter H Hartel. Communication Lifting: fixed point computation for parallelism. Journal of Functional Programming, 5(4):549-581 October 1995

Shortcuts: