Akihiko Takano
Zhenjiang Hu
- APPEL, A. 1992. Compilation with Continuations. Cambridge University Press. Google Scholar
Digital Library
- BIRD, R. 1987. An introduction to the theory of lists. In M. BROY Ed., Logic of Programming and Calculi of Discrete Design (1987), pp. 5-42. Springer-Verlag. Google ScholarDigital Library
- BIRD, R. AND DE MOOR, O. 1997. Algebra of Programming. Prentice Hall. Google ScholarDigital Library
- BURSTALL, R. AND DARLINGTON, J. 1977. A transformation system for developing recursive programs. JACM 24, 1 (Jan.), 44-67. Google ScholarDigital Library
- FOKKINGA, M. 1992. Law and Order in Algorithmics. Ph. D. thesis, University of Twente, The Netherlands.Google Scholar
- GILL, A., LAUNCHBURY, J., AND PEYTON JONES, S. 1993. A short cut to deforestation. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (Copenhagen, Denmark, June 1993), pp. 223-232. ACM Press. Google ScholarDigital Library
- Hu, Z., IWASAKI, H., AND TAKEICHI, M. 1996. Deriving structural hylomorphisms from recursive definitions. In Proceedings of the 1st A CM International Conference on Functional Programming (Philadelphia, PA, May 1996), pp. 73-82. ACM Press. Google ScholarDigital Library
- Hu, Z., IWASAKI, H., TAKEICHI, M., AND TAKANO, A. 1997. Tupling calculation eliminates multiple data traversals. In Proceedings o} the 2rid A CM International Conference on Functional Programming (Amsterdam, The Netherlands, June 1997), pp. 164-175. ACM Press. Google ScholarDigital Library
- Hu, Z., TAKEICHI, M., AND CHIN, W. 1998. Parallelization in calculational forms. In Proceedings of the 25th A CM Symposium on Principles of Programming Languages (San Diego, CA, Jan. 1998). ACM Press. Google ScholarDigital Library
- KELSEY, R. AND HUDAK, P. 1989. Compilation by program transformation. In Proceedings of the 16th A CM Symposium on Principles of Programming Languages (Austin, Texas, Jan 1989), pp. 281-292. ACM Press. Google ScholarDigital Library
- LAUNCHBURY, J. AND SHEARD, T. 1995. Warm fusion: Deriving build-cata's from recursive definitions. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (La Jolla, CA, June 1995), pp. 314-323. ACM Press. Google ScholarDigital Library
- MALCOLM, G. 1990. Data structures and program transformation. Science of Computer Programming 14, 2-3 (Aug.), 255-279. Google ScholarDigital Library
- MEIJER, E., FOKKINGA, M., AND PATERSON, R. 1991. Functional programming with bananas, lenses, envelopes and barbed wire. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (LNCS 523) (Cambridge, MA, Aug. 1991), pp. 124-144. Springer Verlag. Google ScholarDigital Library
- ONOUE, Y., Hu, Z., IWASAKI, H., AND TAKEICHI, M. 1997. A calculational fusion system HYLO. In IFIP TC 2 Working Conference on Algorithmic Languages and Calculi (Le Bischenberg, France, Feb. 1997), pp. 76-106. Chapman&Hall. Google ScholarDigital Library
- PEYTON JONES, S. 1996. Compiling Haskell by program transformation: A report from the trenches. In Proceedings o} the 6th European Symposium on Programming (LNCS 1058) (LinkSping, Sweden, April 1996), pp. 18-44. Springer Verlag. Google ScholarDigital Library
- SHEARD, T. AND FEGARAS, L. 1993. A fold for all seasons. In Proceedings o} the Conference on Functional Programming Languages and Computer Architecture (Copenhagen, Denmark, June 1993), pp. 233-242. ACM Press. Google ScholarDigital Library
- TAKANO, i. AND MEIJER, E. 1995. Shortcut deforestation in calculational form. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (La Jolla, CA, June 1995), pp. 306-313. ACM Press. Google ScholarDigital Library
Index Terms
- Program transformation in calculational form
Recommendations
Proving Theorems by Program Transformation
To Andrzej Skowron on His 70th BirthdayIn this paper we present an overview of the unfold/fold proof method, a method for proving theorems about programs, based on program transformation. As a metalanguage for specifying programs and program properties we adopt constraint logic programming ...
Completing Herbelin's programme
TLCA'07: Proceedings of the 8th international conference on Typed lambda calculi and applicationsIn 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the λ-calculus, specifically a variant which manipulates ...
Comments