Thread View: comp.lang.functional
5 messages
5 total messages
Started by Wolfgang Grieskamp
Mon, 13 Apr 1992 00:42
Programm transformation & Extended Compilation
Author: Wolfgang Grieskamp
Date: Mon, 13 Apr 1992 00:42
Date: Mon, 13 Apr 1992 00:42
44 lines
1926 bytes
1926 bytes
Hello, This is (once again, others did earlier) a query about program transformation, this time in the context of their application in extended compilation (as Feather [1] defines: compilation with programmer advice). Does anyone applies the techniques as f.i. described in the Partsch Book "Specification and Transformation of Programs" [2] for fully or nearly-full automated compilation? * Function composition * Function combination * Partial evaluation & mixed computation * Differencing * Recursion simplification I'am in particular interested in calculi which allow to express and drive transformation process and applicatability condition check in a single integrated framework, like f.i. the RAINBOW II component of the KIDS transformation system shall be (I'am not sure if it does, I have no reference for it, but it is mentioned in [3]). Papers, Projects, Desasters? I will be glad to summarize. Thank You in advance Wolfgang Grieskamp [1] M.S.Feather. A Survey and Classification of Program Transformation Approaches and Techniques. In: Programm Specification and Transformation, L.G.L.T. Meertens (Editor), North Holland, 1987. [2] H.Partsch. Specification and Transformation of Programs. Springer, 1990. [3] KIDS: A Semiautomatic Program Development System. IEEE Transactions on Software Engineering, Vol. 16, No. 9, September 1990. -- Wolfgang Grieskamp wg@cs.tu-berlin.de tub!tubopal!wg wg%opal@DB0TUI11.BITNET
Re: Programm transformation & Extended Compilation
Author: Ken Dickey
Date: Tue, 14 Apr 1992 16:33
Date: Tue, 14 Apr 1992 16:33
39 lines
1885 bytes
1885 bytes
wg@opal.cs.tu-berlin.de (Wolfgang Grieskamp) writes:
>This is (once again, others did earlier) a query about program
>transformation, this time in the context of their application in
>extended compilation ...
------
"Compilation by Program Transformation", Richard Kelsey, Yale PhD
Thesis: YALEU/CSD/RR #702, May 1989. -- Pascal, BASIC, and Scheme
front ends into CPS.
{a report on the above}
Kelsey & Hudak: "Realistic Compilation by Program Transformation",
Sixteenth ACM Symposium on Principles of Programming Languages, 1989.
{uses several of the techniques and has a good bib}
Friedman, Wand, Haynes: _Essentials of Programming Languages_, 1991
ISBN: 0-262-06145-7 (MIT Press) (hb)
0-07-022443-9 (McGraw Hill)
M. Wand, "From Interpreter to Compiler: A Representational
Derivation", in Programs as Data Objects, Springer-Verlag Lecture
Notes #217, 1986.
Note also: {partial evaluation papers}
D. Weise, R. Conybeare, E. Ruf, S. Seligman: "Automatic Online Partial
Evaluation", in Springer-Verlag Lecture Notes in Computer Science
#523, Functional Programming Languages and Computer Architectures.
Andrew Berlin: "Partial Evaluation Applied to Numerical Computation",
in Proceedings of the 1990 ACM Conference on Lisp and Functional
Programming, June 27-29, 1990, [ACM #552900; ISBN 0-89791-368-X].
{various papers}
SIGPLAN NOTICES v26, #9, September 1991: "Proceedings of the Symposium
on Partial Evaluation and Semantics-Based Program Manipulation"
Standard ML concurrency primitives
Author: Richard T. Saunders
Date: Wed, 15 Apr 1992 20:39
Date: Wed, 15 Apr 1992 20:39
15 lines
1050 bytes
1050 bytes
Hi, I am looking for references to papers/implementation that introduce concurrency primitives explicitly into the language Standard ML (or any version of ML---I am most familiar with SML of NJ). Note that I am not looking for a concurrent SML (one that takes normal SML and parallelizes it), but rather an SML with new primitives into the language to manage concurrency. Do any such beasts exist in theory/in practice? I believe I have seen such references in the past in this newsgroup. Thanks for any pointers/help in advance. saunders@caslon.cs.arizona.edu | "This is NOT Mel Torme!" - Top Secret
Re: Standard ML concurrency primitives
Author: Andrew Koenig
Date: Thu, 16 Apr 1992 13:16
Date: Thu, 16 Apr 1992 13:16
11 lines
940 bytes
940 bytes
In article <3631@caslon.cs.arizona.edu> saunders@cs.arizona.edu (Richard T. Saunders) writes: > I am looking for references to papers/implementation that introduce > concurrency primitives explicitly into the language Standard ML (or > any version of ML---I am most familiar with SML of NJ). Check the proceedings of the January 1992 ACM Principles of Programming Languages conference. -- --Andrew Koenig ark@europa.att.com
Re: Standard ML concurrency primitives
Author: Frederick Knabe
Date: Thu, 16 Apr 1992 16:19
Date: Thu, 16 Apr 1992 16:19
10 lines
1137 bytes
1137 bytes
Greg Morrisett at Carnegie Mellon has developed a whole threads package for SML/NJ. This is described in the CMU tech report CMU-CS-90-186. You may also contact Greg directly at jgmorris@cs.cmu.edu. I have used this package extensively; it provides multiple lightweight threads with preemptive scheduling, as well as various synchronization and exclusion primitives. If you have a SG Iris, you can even run the threads in parallel (real concurrency). Fritz Knabe
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads