Program transformations for configuring components
References
[1]
S. Abramsky and C. Hankin. Abstract h, terpre. ~atzon of Applicat~.ve La~g~tagcs. Michael Horwood, London, 1987.
[2]
Andrew A. Berlin. Partial evaluation applied to numerical computation. In A UM Conference on Lisp and Functional Programming, pages 139- 150, 1990.
[3]
A. Bondorf. Automatic autoprojection of higher order recursive equations. In ESOP'90, 1990.
[4]
Y. Futamura and K. Nogi. Generalized partial computation. In D. Bjorner, A. P. Erschov, and N. D. Jones, editors, Partial Evaluation and M, xed Computation. North-Holland, 1988.
[5]
N. D. Jones, C. Gomard, A. Bondorf, O. Danvy, and T. Mogensen. A self-applicable partial evaluator for the lambda-calculus. In IEEE Computer Society 1990 International Conference on Computer Languages, 1989.
[6]
N. D. Jones, P. Sestoft, and H. SO ndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2, 1989.
[7]
J. M. Lucassen. Types and Effects, towards the integration of functzonal and zmperative programming. PhD thesis, MIT, 1987. Also available as LCS T1~-408.
[8]
J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In Conference record of the 15th annual A CM symposium on principles of programming languages, pages 47-57, 1988.
[9]
I. A. M~son. The Semantics of Destructive Lisp. PhD thesis, Stanford University, 1986.
[10]
I. A. Mason and C. L. Talcott. Axiomatizing operational equivalence in the presence of side effects. In Fourth Annual Symposium on logic in computer science. IEEE, 1989.
[11]
I. A. Mason and C. L. Talcott. Programming, transforming, and proving with function abstractions and memories. In Proceedings of the 16th EATCS Colloquium on Automata, Languages, and Programming, Strcsa, 1989.
[12]
I. A. Mason and C. L. Talcott. A sound and complete axiomatization of operational equivalence between programs with memory. Technical Report STAN-CS-89-1250, Department of Computer Science, Stanford University, 1989.
[13]
I. A. Mason and C. L. Talcott. Equivalence in functional languages with effects. Journal of Funchonal Programming, to appear, 199?
[14]
I. A. Mason and C. L. Talcott. Inferring the equivalence of (first-order) functional programs that mutate data. Theoretical Computer Science, to appear, 199?
[15]
I. A. Mason and C. L. Talcott. Program transformation via constraint propagation. 199? submitted for publication.
[16]
E. Moggi. Computational lambda-calculus and monads. In Fourth Annual Symposium on Logic in Computer Science. IEEE, 1989.
[17]
G. Plotkin. Call-by-name, call-by-value and the lambda-v-calculus. Theoretical Computer Science, 1, 1975.
[18]
O. Shivers. Control flow analysis in Scheme. In Proceedings of SIGPLAN '88 Conference on Programming Language Design and Implementation, 1988.
[19]
C. L. Talcott and R. W. Weyhrauch. Partial evaluation, higher-order abstractions, and reflection principles as system building tools. In D. Bjorner, A. P. Erschov, and N. D. Jones, editors, Parlzal Evaluation and Mixed Computation. North-Holland, 1988.
[20]
Daniel. Weise. Graphs as intermediate representation for partial evaluation. Technical report, Stanford University Computer Systems Laboratory, 1990. submitted for publication.
Index Terms
- Program transformations for configuring components
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sept. 1991
333 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/115866
- Editor:
- Richard L. Wexelblat
Copyright © 1991 ACM.
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
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 225Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)9
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in