article

Free access

A syntactic approach to program transformations

Author:

Zena M. AriolaAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 9

Pages 116 - 129

https://doi.org/10.1145/115866.115878

Published: 01 May 1991 Publication History

PDF eReader

References

[1]

A. Aho, J. Ullman, and R. Sethi. Compilers: Principles, Techniques, Tools. London, Addison-Wesley, 1986.

Digital Library

Google Scholar

[2]

Z. M. Ariola and Arvind. P-TAC: A Parallel Intermediate Language. In Proc. A CM Conference on Functional Programming Languages and Computer Architecture, London, 1989.

Digital Library

Google Scholar

[3]

Z. M. Ariola and Arvind. Compilation of Id-: a Subset of Id. Technical Report CSG Memo 315, MIT Laboratory ~or Compute~ Science~ July 1990.

Google Scholar

[4]

Z. M. Ariola and Arvind. Contextual Rewriting. Technical Report CSG Memo 323, MIT Laboratory for Computer Science, 1991.

Google Scholar

[5]

Arvind, R. S. Nikhfl, and K. K. Pingali. I-Structures: Data Structures for Parallel Computing. ACM Transactions on Programming Languages and Systems, 11(4), October 1989.

Digital Library

Google Scholar

[6]

H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984.

Google Scholar

[7]

H. P. Barendregt, T. H. Brus, M. C. J. D. van F.ekelen, J. R. W. Glauert, J. R. Kennawa.y, M. O. van Leer, M. J. Plasmeijer, and M. R. Sleep. Towards an Intermediate Language based on Graph Rewriting. In Proceedings of the PARLE Conference, Eindhoven, The Netherlands, Springer-Verlag L NCS ~59, June 1987.

Digital Library

Google Scholar

[8]

H. P. Barendregt, M. C. J. D. van Eckelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeljer, and M. R. Sleep. Term Graph Rewriting. In Proceedings of the PA RL E Conference, Eindhoven, The Netherlands, Springer. Verlag LNCS $59, pages 141-158, June 1987.

Digital Library

Google Scholar

[9]

T. Brus, M. van Eekelen, M. yam Leer, and M. Plasmeijet. Clean- A Language for Functional Graph Rewriting. In Proc. A CM Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, Springer-Verlag LNCS 274~ :1987.

Digital Library

Google Scholar

[10]

B. Courcelle. Fundamentals Properties of Infinite Trees. D. Reidel Publishing Company, 1982.

Google Scholar

[11]

N. de Bruijn. Lambda Calculus Notattion with Nameless Dummies: A Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem. In Koninkijke Nederlandse Akademie van Wetensehap. pen, Series A, Mathematical Sciences, 1972.

Google Scholar

[12]

P. Hudak and P. Wadler. Report on the Programming Language Haskell, A Non-strict Purely Functional Language (Version 1.0). Technical Report YALEU/DCS/RR777, Yale University, Department of Computer Science, April 1990.

Google Scholar

[13]

T. Johnsson. Efficient Compilation of Lazy Evaluation. In Proceedings of the A CM SIGPLtl N '84 Symposium on Compiler Construction, pages 58-69, June 1984.

Digital Library

Google Scholar

[14]

V. Kathail. Optimal Interpreters for Lambda-calculus Based Funtional Languages. May 1990. Ph.D. thesis, Dept. of Electrical Engineering and Computer Science, MIT.

Google Scholar

[15]

J. Klop. Term Rewriting Systems. l't Autumn workshop on Reduction Machines, Italy, September 1985.

Google Scholar

[16]

R. S. Nikhil. Id (Version 90.0) Reference Manual. Technical Report CSG Memo 284-a, MIT Laboratory for Computer Science, July 1990.

Google Scholar

[17]

S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-HaU International, Englewood Cliffs, N.J., 1987.

Digital Library

Google Scholar

[18]

G. Plotkin. Call-by-name, Call-by-value and the Lambda Calculus. Theoretical Computer Science, 1:125-159, 1975.

Crossref

Google Scholar

[19]

D. A. Turner. A New Implemetation Technique for Applicative Languages. In Software . Practice and Experience, volume 9, pages 31-49, 1979.

Google Scholar

[20]

D. A. Turner. Miranda: a non-strict functional language with polymorphic types. In IFIP Int'l Conf. on Functional Programming and Computer Architecture, Nancy, France, Springer-Verlag LNCS ~01, 1985.

Digital Library

Google Scholar

[21]

C. Wadsworth. Semantics And Pragmatics Of The Lambda.Calculus. Ph.D. thesis, University of Oxford, Semtember 1971.

Google Scholar

[22]

C. Wadsworth. Approximate Reduction and Lambda Calculus Models. Theoretical Computer Science, 7, 1978.

Google Scholar

Cited By

View all

Stefanescu DZhou Y(2019)An equational framework for the flow analysis of higher order functional programsACM SIGPLAN Lisp Pointers10.1145/182590.182497VII:3(318-327)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/182590.182497
Lee TYu P(2004)Efficient Representation of Algebraic ExpressionsAutomated Technology for Verification and Analysis10.1007/978-3-540-30476-0_39(474-478)Online publication date: 2004
https://doi.org/10.1007/978-3-540-30476-0_39
Stefanescu DZhou YKessler R(1994)An equational framework for the flow analysis of higher order functional programsProceedings of the 1994 ACM conference on LISP and functional programming10.1145/182409.182497(318-327)Online publication date: 1-Jul-1994
https://dl.acm.org/doi/10.1145/182409.182497
Show More Cited By

Index Terms

A syntactic approach to program transformations

Recommendations

Decoding with syntactic and non-syntactic phrases in a syntax-based machine translation system
SSST '09: Proceedings of the Third Workshop on Syntax and Structure in Statistical Translation

A key concern in building syntax-based machine translation systems is how to improve coverage by incorporating more traditional phrase-based SMT phrase pairs that do not correspond to syntactic constituents. At the same time, it is desirable to include ...
Syntactic transformations for Swiss German dialects
DIALECTS '11: Proceedings of the First Workshop on Algorithms and Resources for Modelling of Dialects and Language Varieties

While most dialectological research so far focuses on phonetic and lexical phenomena, we use recent fieldwork in the domain of dialect syntax to guide the development of multidialectal natural language processing tools. In particular, we develop a set ...
Incremental syntactic language models for phrase-based translation
HLT '11: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1

This paper describes a novel technique for incorporating syntactic knowledge into phrase-based machine translation through incremental syntactic parsing. Bottom-up and top-down parsers typically require a completed string as input. This requirement ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 9

Sept. 1991

333 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/115866

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

Issue’s Table of Contents

PEPM '91: Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
May 1991
333 pages
ISBN:0897914333
DOI:10.1145/115865
Chairmen:
Charles Consel,
Olivier Danvy

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 May 1991

Published in SIGPLAN Volume 26, Issue 9

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
293
Total Downloads

Downloads (Last 12 months)39
Downloads (Last 6 weeks)7

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Stefanescu DZhou Y(2019)An equational framework for the flow analysis of higher order functional programsACM SIGPLAN Lisp Pointers10.1145/182590.182497VII:3(318-327)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/182590.182497
Lee TYu P(2004)Efficient Representation of Algebraic ExpressionsAutomated Technology for Verification and Analysis10.1007/978-3-540-30476-0_39(474-478)Online publication date: 2004
https://doi.org/10.1007/978-3-540-30476-0_39
Stefanescu DZhou YKessler R(1994)An equational framework for the flow analysis of higher order functional programsProceedings of the 1994 ACM conference on LISP and functional programming10.1145/182409.182497(318-327)Online publication date: 1-Jul-1994
https://dl.acm.org/doi/10.1145/182409.182497
Matskin MKomorowski JKrogstie J(2005)Partial deduction in the framework of structural synthesis of programsLogic Program Synthesis and Transformation10.1007/3-540-62718-9_14(239-255)Online publication date: 3-Jun-2005
https://doi.org/10.1007/3-540-62718-9_14
Rose K(2005)Explicit cyclic substitutionsConditional Term Rewriting Systems10.1007/3-540-56393-8_3(36-50)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-56393-8_3
Sands D(2005)Time analysis, cost equivalence and program refinementFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-54967-6_59(25-39)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-54967-6_59
Matskin MKomorowski J(1997)Partial Structural Synthesis of ProgramsFundamenta Informaticae10.5555/2379404.237940731:2(125-144)Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.5555/2379404.2379407
Ariola ZMassey BSami MTick E(1996)A common intermediate language and its use in partitioning concurrent declarative programsNew Generation Computing10.1007/BF0303748514:3(281-315)Online publication date: Sep-1996
https://doi.org/10.1007/BF03037485
Ariola Z(1996)Relating graph and term rewriting via Böhm modelsApplicable Algebra in Engineering, Communication and Computing10.1007/BF012935987:5(401-426)Online publication date: 1-Sep-1996
https://dl.acm.org/doi/10.1007/BF01293598
Aditya SStoy JArvind Williams J(1995)Semantics of barriers in a non-strict, implicitly-parallel languageProceedings of the seventh international conference on Functional programming languages and computer architecture10.1145/224164.224206(204-215)Online publication date: 1-Oct-1995
https://dl.acm.org/doi/10.1145/224164.224206
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Decoding with syntactic and non-syntactic phrases in a syntax-based machine translation system

Syntactic transformations for Swiss German dialects

Incremental syntactic language models for phrase-based translation

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

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations