Compiler Technology and Application Laboratory

CTAHome® Login
Transferred Projects





  1. Project Name
    • 一個使用集合程式語言的最佳化程式的研製。


  2. Project Purpose
    • 整合物件複製消除分析以及有限微分的技術,我們可以進一步提升使用聚集資料結構之程式語言的程式執行效能。


      純粹函數式程式語言在工業界缺乏一個可以直接使用集合的程式語言,而NYU EAS程式語言當初是為實驗進行而設計,本身並不適用於大型程式的開發。




  3. Project Schedule
    • 本計畫之進行從民國九十一年八月一日起,計畫於民國九十二年七月三十日完成。

  5. Project Reference
      • 參考文獻

        [App92] A.W. Appel. Compiling with Continuations, Cambridge Press, 1992.

        [Ber82] F. Le Berre. Un Langage pour manipuler les ensembles: MANENS, Ph.D. thesis, Paris VII, 1982.

        [Blo94] A. Bloss. Path Analysis and the Optimization of Non-strict Functional Languages,ACM Transactions on Programming Languages and Systems, Vol. 16, No. 3, pp. 328-369, May 1994.

        [CG92] T.-R. Chuang, and B. Goldberg. Backward Analysis for Higher-Order Functions Using Inverse Image,Technical Report, TR 1992-620, Computer Science Department, New York University, New York, 1992.

        [DP93] M. Draphicescu, and S. Purushothaman. A Uniform Treatment of Order of Evaluation and Aggregate Update,Theoretical Computer Science, B, 2(118), September 1993; also in Proceedings of the 1990 ACM Conference on Lisp and Functional Programming.

        [GH89] K. Gopinath, and J. L. Hennessy. Copy Elimination in Functional Languages,16th ACM Symposium on Principles of Programming Languages, pp. 303-314, 1989.

        [Gou94] J. Goubault. “HimML: Standard ML with fast sets and maps,” ACM SIGPLAN Workshop on Standard ML and its Applications, June 1994.

        [GP98] D. Goyal, and R. Paige. “A New Solution to the Hidden Copy Problem,” Technical Report #763, Computer Science Department, New York University, New York, 1998.

        [Hud87] P. Hudak. A Semantic Model of Reference Counting and Its Abstraction,Abstract Interpretation of Declarative Languages, S. Abramsky and C. Hankin, editors, Ellis Horwood Press, 1987.

        [Lac92] J.-J. Lacrampe. “S3L a tire d’ailes,” Technical Report 92-11, Laboratoir d’Informatique Fondamentale de l’Universite d’Orleans, BP 6759-45067, Orleans Cedex 2, France, 1992.

        [Pai81] R. Paige. Formal Differencing: A Program Synthesis Technique, UMI Research Press, 1981.

        [PK82] R. Paige, and S. Koenig. “Finite Differencing of Computable Expressions,” ACM Transactions on Programming Languages and Systems, pp. 402-454, Vol. 4, No. 3, July 1982.

        [SDD86] J.T. Schwartz, R.B.K. Dewar, E. Dubinsky, E. Schonberg. Programming With Sets: An Introduction to SETL, Springer-Verlag Press, 1986.

        [Sny90] W.K. Snyder. “The SETL2 Programming Language,” Technical Report 490, Computer Science Department, New York University, September 1990.

        [WC98] M. Wand, and W. D. Clinger. Set Constraints for Destructive Array Update Optimization,Proceedings of ICCL 1998, May 1998.

        [Yun97] C. Yung. Extending Typed Lambda Calculus to Sets,Proceedings of MASPLAS 1997, in cooperation with ACM SIGPLAN, Stroudsburg PA, April 1997.

        [Yun98] C. Yung. EAS: An Experimental Applicative Language With Sets,Proceedings of MASPLAS 1998, in cooperation with ACM SIGPLAN, New Brunswick NJ, April 1998.

        [Yun00] C. Yung. “Dynamic Copy Elimination For Strict Functional Languages,” Proceedings of CTHPC’2000, the 6th Workshop on Compiler Techniques for High-Performance Computing, pp. 206-216, Taiwan, March 2000.

Partially supported by:

Copyright © 2008, All rights reserved by CTA Lab.
1, Sec. 2, Da Hsueh Rd., Shou-Feng, Hualien, Taiwan, 974, Republic of China
Phone:+886 03-8635000#4046
Last update: 2012/09/28