Separating binding times in language specifications

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Separating binding times in language specifications

Full text

Pdf (1.05 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the fourth international conference on Functional programming languages and computer architecture table of contents

Imperial College, London, United Kingdom

Pages: 12 - 25

Year of Publication: 1989

ISBN:0-89791-328-0

Author

Torben Æ Mogensen

DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 København ø, Denmark

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 6, Citation Count: 16

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/99370.99372 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Bondorf et al. 89	A. Bondorf, N. D. Jones, T. }E. Mogensen, P. Sestoft, Self-application as a Tool for the Generation of Program Generators. To be published.
	Hughes 88	J. Hughes, Backwards Analysis of FunctionaI Programs, Workshop on Partial Evaluation and Mixed Computation, Gl. A vernres, Denmark, Oc~tober 1987 (eds. D. BjOrner, A. P. Ershov and N. D. Jones), North-Holland 1988, pp. 187-208
	Jones 88	N. D. Jones, Automatic Program Specialization: A Re-examination from Basic Principles, Workshop on Partial Evaluation and Mixed Cornputalion, GI. A vernees, Denmark, October 1987 (eds. D. BjCrner, A. P. Ershov and N. D. Jones), North-Holland 1988, pp. 225-282
	Jones et al. 85	Neil D. Jones , Peter Sestoft , Harald Sondergaard, An experiment in partial evaluation: the generation of a compiler generator, Proc. of the first international conference on Rewriting techniques and applications, p.124-140, December 1985, Dijon, France
	Jones et al. 89	N. D. Jones, P. Sestoft and It. SCndergaard, Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. Lisp and Symbolic Compuiation 2,1 (1989), pp. 9-50
	Jørring and Sherlis 86	Ulrik Jørring , William L. Scherlis, Compilers and staging transformations, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.86-96, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512652]
	Launchbury 88	J. Launchbury, Projections for Specialisation, Workshop on Partial Evaluation and Mixed Computaiion, Gi. A verncrs, Denmark, October 1987 (eds. D. Bjorner, A. P. Ershov and N. D. Jones), North-Holland 1988, pp. 299-315
	Mogensen 88	T. ~. Mogensen, Partially Static Structures in a Self-Applicable Partial }}valuator, Workshop on Partial Evaluation and Mixed Computation, GI. A vernces, Denmark, October 1987 (eds. D. Bj0rner, A. P. Ershov and N. D. Jones), North- Ilolland 1988, pp. 325-347
	Mogensen 89	Torben Æ. Mogensen, Binding Time Analysis for Polymorphically Typed Higher Order Languages, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages, p.298-312, March 13-17, 1989
	Nielson 88	H. R. Nielson , F. Nielson, Automatic binding time analysis for a typed &lgr;-calculus, Science of Computer Programming, v.10 n.2, p.139-176, April 1988 [doi>10.1016/0167-6423(88)90025-1 ]
	Romanenko 88	S. A. Romanenko, A Compiler Generator Produced by a Self-Applicable Specializer Can tiave a Surprisingly Natural and Understandable Structure, Workshop on Partial Evaluation and illized Computation, GI. Avernaxs, Denmark. October 1987 (eds. D. BjOrner, A. P. Ershov and N. D. Jones), North-Holland 1988, pp. 445-463
	Sestoft 86	Peter. Sestoft, The structure of a self-applicable partial evaluator, on Programs as data objects, p.257-281, April 1986, Copenhagen, Denmark

CITED BY 16

	Anne De Niel , Eddy Bevers , Karel De Vlaminck, Program bifurcation for a polymorphically typed functional language, ACM SIGPLAN Notices, v.26 n.9, p.142-153, Sept. 1991
	Hanne Riis Nielson , Flemming Nielson, Shape analysis for mobile ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.142-154, January 19-21, 2000, Boston, MA, USA
	Johan Agat, Transforming out timing leaks, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.40-53, January 19-21, 2000, Boston, MA, USA
	Peter Thiemann, A safety analysis for functional languages, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.133-144, June 14-16, 1993, Copenhagen, Denmark
	Julia L. Lawall, Proofs by structural induction using partial evaluation, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.155-166, June 14-16, 1993, Copenhagen, Denmark
	Kenichi Asai , Hidehiko Masuhara , Akinori Yonezawa, Partial evaluation of call-by-value &lgr;-calculus with side-effects, ACM SIGPLAN Notices, v.32 n.12, p.12-21, Dec. 1997
	Thomas Reps, Shape analysis as a generalized path problem, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.1-11, June 21-23, 1995, La Jolla, California, United States
	Carsten Kehler Holst , Darsten Krogh Gomard, Partial evaluation is fuller laziness, ACM SIGPLAN Notices, v.26 n.9, p.223-233, Sept. 1991
	Bernd Grobauer , Julia L. Lawall, Partial evaluation of pattern matching in strings, revisited, Nordic Journal of Computing, v.8 n.4, p.437-462, December 2001
	Mooly Sagiv , Thomas Reps , Reinhard Wilhelm, Solving shape-analysis problems in languages with destructive updating, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.1, p.1-50, Jan. 1998
	Nevin Heintze, Set-based analysis of ML programs, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.306-317, July-Sept. 1994
	Todd B. Knoblock , Erik Ruf, Data specialization, ACM SIGPLAN Notices, v.31 n.5, p.215-225, May 1996
	Michael Sperber , Robert Glück , Peter Thiemann, Bootstrapping higher-order program transformers from interpreters, Proceedings of the 1996 ACM symposium on Applied Computing, p.408-413, February 17-19, 1996, Philadelphia, Pennsylvania, United States
	Michael Sperber , Peter Thiemann, Realistic compilation by partial evaluation, ACM SIGPLAN Notices, v.31 n.5, p.206-214, May 1996
	Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Static caching for incremental computation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.3, p.546-585, May 1998
	Yanhong A. Liu , Scott D. Stoller, Eliminating dead code on recursive data, Science of Computer Programming, v.47 n.2-3, p.221-242, May 2003