article

Free access

Parallel-program transformation using a metalanguage

Authors:

J. Allan Yang,

Young-il ChooAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 7

Pages 11 - 20

https://doi.org/10.1145/109626.109628

Published: 01 April 1991 Publication History

PDF eReader

References

[1]

H. P. Barendregt. The Lambda Calculus- its syntax and semantics. North Holland, 1981.

Google Scholar

[2]

F. Bauer, B. MSller, H. Partsch, and P. Pepper. Formal program construction by transformations - computeraided, intuition-guided programming. IEEE Transactions on Software Engineering, 15(2):165-180, Feb. 1989.

Digital Library

Google Scholar

[3]

R. M. Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the Association for Computing Machinery, 24(1):44-67, January 1977.

Digital Library

Google Scholar

[4]

Marina Chen, Young-fl Choo, and Jingke Li. Compiling parallel programs by optimizing performance. The Journal of Supercomputing, 2(2):171-207, October 1988.

Crossref

Google Scholar

[5]

Marina C. Chen. A design methodology for synthesizing parallel algorithms and architectures. Journal of Parallel and Distributed Computing, pages 461-491, December 1986.

Digital Library

Google Scholar

[6]

Marina C. Chen. A parallel language and its compilation to multiprocessor machines. In The Proc. of the 13th Sympo. on Principles of Programming Languages, January 1986.

Digital Library

Google Scholar

[7]

Young-il Choo and Marina Chen. A theory of parallel-program optimization. Technical Report YALEU/DCS/TR-608, Dept. of Computer Science, Yale University, July 1988.

Google Scholar

[8]

A. Church. The Calculi of Lambda Conversion. Princeton University Press, Princeton, N J, 1941.

Digital Library

Google Scholar

[9]

J. Darlington and R. M. Burstall. A system which automatically improves programs. Acta Informatica, 6:41- 60, 1976.

Digital Library

Google Scholar

[10]

John Darlington. An experimental program transformation and synthesis system. Artificial Intelligence, 16:1-46, 1981.

Digital Library

Google Scholar

[11]

Martin S. Feather. A system for assisting program transformation. A CM Transaction on Programming Language and Systems, pages 1-20, January 1982.

Digital Library

Google Scholar

[12]

David B. Loveman. Program improvement by sourceto-source transformation. Journal o/ the Association for Computing Machinery, 24(1):121-145, January 1977.

Digital Library

Google Scholar

[13]

R. Milner. A proposal for standard ML. In A CM Syrup. on LISP and Functional Programming, pages 184-197, Aug. 1984.

Digital Library

Google Scholar

[14]

H. Partsch and R. Steinbrfiggen. Program transformation systems.Computing Surveys, 15(3):199-236, September 1983.

Digital Library

Google Scholar

[15]

J. Allan Yang and Young-fl Choo. Meta-Crystal- a metalanguage for parallel-program optimization. Technical Report YALEU/DCS/TR-786, Dept. of Computer Science, Yale University, April 1990.

Google Scholar

Cited By

View all

Fitzpatrick SHarmer TStewart AClint MBoyle J(1997)The automated transformation of abstract specifications of numerical algorithms into efficient array processor implementationsScience of Computer Programming10.1016/S0167-6423(96)00015-928:1(1-41)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.1016/S0167-6423%2896%2900015-9
Thiele L(1993)Mapping Algorithms onto VLSI ArchitecturesVLSI Implementations for Image Communications10.1016/B978-0-444-88790-0.50009-5(69-116)Online publication date: 1993
https://doi.org/10.1016/B978-0-444-88790-0.50009-5
Pepper P(1993)Deductive Derivation of Parallel ProgramsParallel Algorithm Derivation and Program Transformation10.1007/978-0-585-27330-3_1(1-53)Online publication date: 1993
https://doi.org/10.1007/978-0-585-27330-3_1
Show More Cited By

Index Terms

Parallel-program transformation using a metalanguage

Recommendations

Proving Theorems by Program Transformation
To Andrzej Skowron on His 70th Birthday

In 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 applications

In 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 ...
Program derivation by proof transformation

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 7

July 1991

223 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/109626

Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA

Issue’s Table of Contents

PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
April 1991
223 pages
ISBN:0897913906
DOI:10.1145/109625
Chairman:
David S. Wise
Indiana Univ., Bloomington

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1991

Published in SIGPLAN Volume 26, Issue 7

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
3,062
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)14

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fitzpatrick SHarmer TStewart AClint MBoyle J(1997)The automated transformation of abstract specifications of numerical algorithms into efficient array processor implementationsScience of Computer Programming10.1016/S0167-6423(96)00015-928:1(1-41)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.1016/S0167-6423%2896%2900015-9
Thiele L(1993)Mapping Algorithms onto VLSI ArchitecturesVLSI Implementations for Image Communications10.1016/B978-0-444-88790-0.50009-5(69-116)Online publication date: 1993
https://doi.org/10.1016/B978-0-444-88790-0.50009-5
Pepper P(1993)Deductive Derivation of Parallel ProgramsParallel Algorithm Derivation and Program Transformation10.1007/978-0-585-27330-3_1(1-53)Online publication date: 1993
https://doi.org/10.1007/978-0-585-27330-3_1
Nair AChandra V(2007)A MetaL for C and PascalACM SIGCSE Bulletin10.1145/1345375.134542239:4(87-91)Online publication date: 1-Dec-2007
https://dl.acm.org/doi/10.1145/1345375.1345422
Mirenkov NMirenkova T(1997)Program Synthesis from Film SpecificationsProceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis10.5555/523978.826097Online publication date: 17-Mar-1997
https://dl.acm.org/doi/10.5555/523978.826097
Chin WHagiya M(1995)A transformation method for dynamic-sized tabulationActa Informatica10.1007/BF0117774232:2(93-115)Online publication date: Feb-1995
https://doi.org/10.1007/BF01177742
Arzt UTeich JThiele L(1992)The concepts of COMPAR- a compiler for massively parallel architectures[Proceedings] 1992 IEEE International Symposium on Circuits and Systems10.1109/ISCAS.1992.230160(681-684)Online publication date: 1992
https://doi.org/10.1109/ISCAS.1992.230160
Arzt UTeich JSchumacher MThiele L(1992)Hierarchical concepts in the design of processor arraysCompEuro 1992 Proceedings Computer Systems and Software Engineering10.1109/CMPEUR.1992.218504(232-237)Online publication date: 1992
https://doi.org/10.1109/CMPEUR.1992.218504
Teich JThiele L(1992)A transformative approach to the partitioning of processor arrays[1992] Proceedings of the International Conference on Application Specific Array Processors10.1109/ASAP.1992.218585(4-20)Online publication date: 1992
https://doi.org/10.1109/ASAP.1992.218585
Chen MChen DHu YJacquemin MLin CWu J(1992)Parallelizing Programs for Distributed-Memory Machines Using the Crystal SystemLanguages, Compilers and Run-Time Environments for Distributed Memory Machines10.1016/B978-0-444-88712-2.50016-0(237-254)Online publication date: 1992
https://doi.org/10.1016/B978-0-444-88712-2.50016-0

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Proving Theorems by Program Transformation

Completing Herbelin's programme

Program derivation by proof transformation

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations