Article

Free access

Using types to avoid redundant specialization

Authors:

Erik Ruf,

Daniel WeiseAuthors Info & Claims

PEPM '91: Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Pages 321 - 333

https://doi.org/10.1145/115865.115902

Published: 01 May 1991 Publication History

PDF eReader

References

[1]

A. Bondorf and O. Danvy. Automatic autoprojection for recursive equations with global variables and abstract data types. DIKU Report 90/04, University of Copenhagen, Copenhagen, Denmark, 1990.

Google Scholar

[2]

M. A. Bulyonkov. Polyvariant mixed computation for analyzer programs. Acta Informatica, 21:473- 484, 1984.

Digital Library

Google Scholar

[3]

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

Digital Library

Google Scholar

[4]

C. Consel. Binding time analysis for higher order untyped functional languages. In Proceedings of ~he 1990 ACM Conference on Lisp and Functional Programming, pages 264-272, Nice, France, 1990.

Digital Library

Google Scholar

[5]

G. DeJong and R. Mooney. Explanation-based learning" An alternative view. Machine Learning, 1(2):145-176, 1986.

Digital Library

Google Scholar

[6]

Y. Futamura and K. Nogi. Generalized partial computation. In D. Bjerner, A. Ershov, and N. Jones, editors, Partial Evaluation and Mixed Computation, pages 133-151. North-Holland, 1988.

Google Scholar

[7]

C. Ghezzi, D. Mandrioli, and A. Tecchio. Program simplification via symbolic interpretation. In S. Maheshwari, editor, Foundations of Software Technology and Theoretical Computer Science. Fifth Conference, New Delhi, India. (Lecture Notes in Computer Science, Vol. 206), pages 116- 128. Springer-Verlag, 1985.

Digital Library

Google Scholar

[8]

A. ttaraldsson. A Program Manipulation System Based on Partial Evaluation. PhD thesis, LinkSping University, 1977. Published as Link5ping Studies in Science and Technology Dissertation No. 14.

Google Scholar

[9]

N. D. Jones, P. Sestoft, and H. Sendergaard. An experiment in partial evaluation: The generation of a compiler generator. In Rewriting Techniques and Applications, pages 124-140. Springer-Verlag, LNCS 202, 1985.

Crossref

Google Scholar

[10]

K. M. Kahn. A partial evaluator of Lisp programs written in Prolog. In M. V. Caneghem, editor, First International Logic Programming Conference, pages 19-25, Marseille, France, 1982.

Google Scholar

[11]

J. Launchbury. Projection Faetorisations in Partial Evaluation. PhD thesis, University of Glasgow, 1991. Published as CS Report CS(' 90/R2.

Google Scholar

[12]

D. B. MacQueen, G. Plotkin, and R. Sethi. An ideal model for reeursive polymorphie types. In Proceedings of lhe Eleventh A CM Symposium on Priuciplc~ of Programming Languagc~, pages 165- 174, January 1984.

Digital Library

Google Scholar

[13]

T. Mitchell, M. Keller, and S. T. Kedar-Cabelli. Explanation-based generalization: A unifying view. Machine Learning, 1(1):47-80, 1986.

Digital Library

Google Scholar

[14]

T. Mogensen. Partially static structures, in D. Bjerner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 325-347. North-Holland, 1988.

Google Scholar

[15]

T. Mogensen. Binding Time Aspecls of Partial Evaluatzon. PhD thesis, DIKU, University of Copenhangen, Copenhagen, Denmark, March 1989.

Google Scholar

[16]

J. Rees, W. Clinger, et al. Revised3 report on the algorithmic language Scheme. A CM SIGPLAN Notices, 21(12):37-79, December 1986.

Digital Library

Google Scholar

[17]

R. Schooler. Partial evaluation as a means of language extensibility. Master's thesis, MIT, Cambridge, MA, August 1984. Published as MIT/LCS/TR-324.

Digital Library

Google Scholar

[18]

V. Turchin. The algorithmn of generalization in the supercompiler, in D. Bjerner, A. P. Ershov, and N. D. jones, editors, Partial Evaluation and Mixed Computation, pages 531-549. North-Holland, 1988.

Google Scholar

[19]

F. van Harmelen and A. Bundy. Explanation-based generalisation = partial evaluation. Artificial Intelligence, 36(3):401-412, October 1988.

Digital Library

Google Scholar

[20]

D. Weise. Graphs as an intermediate representation for partial evaluation. Technical Report CSL- TR-90-421, Computer Systems Laboratory, Stanford University, Stanford, CA, 1990.

Google Scholar

[21]

D. Weise and E. Ruf. Computing types during program specialization. Technical Report CSL-TR-90- 441, Computer Systems Laboratory, Stanford University, Stanford, CA, 1990.

Digital Library

Google Scholar

[22]

J. Young and P. O'Keefe. Experience with a type evaluator. In D. Bjerner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 573-581. North-Holland, 1988.

Google Scholar

Cited By

View all

Dean JChambers CGrove D(2019)Selective specialization for object-oriented languagesACM SIGPLAN Notices10.1145/223428.20711930:6(93-102)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/223428.207119
Dean JChambers C(2019)Towards better inlining decisions using inlining trialsACM SIGPLAN Lisp Pointers10.1145/182590.182489VII:3(273-282)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/182590.182489
Marlet R(2013)BibliographyProgram Specialization10.1002/9781118576984.biblio(487-522)Online publication date: 5-Feb-2013
https://doi.org/10.1002/9781118576984.biblio
Show More Cited By

Index Terms

Using types to avoid redundant specialization

Recommendations

Singleton types here, singleton types there, singleton types everywhere
PLPV '10: Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification

Singleton types are often considered a poor man's substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage of singleton types and GADTs is to preserve the so-called phase distinction, ...
Qualified types for MLF
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a local type annotation is required. Qualified types are a general concept that ...
Qualified types for MLF
ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a local type annotation is required. Qualified types are a general concept that ...

Comments

Information & Contributors

Information

Published In

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

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

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

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PEPM

Sponsor:

SIGPLAN

PEPM: ACM Symposium on Partial Evaluation and Semantics/Based Program Manipulation

June 17 - 19, 1991

Connecticut, New Haven, USA

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
320
Total Downloads

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

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dean JChambers CGrove D(2019)Selective specialization for object-oriented languagesACM SIGPLAN Notices10.1145/223428.20711930:6(93-102)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/223428.207119
Dean JChambers C(2019)Towards better inlining decisions using inlining trialsACM SIGPLAN Lisp Pointers10.1145/182590.182489VII:3(273-282)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/182590.182489
Marlet R(2013)BibliographyProgram Specialization10.1002/9781118576984.biblio(487-522)Online publication date: 5-Feb-2013
https://doi.org/10.1002/9781118576984.biblio
Weise DConybeare RRuf ESeligman S(2005)Automatic online partial evaluationFunctional Programming Languages and Computer Architecture10.1007/3540543961_9(165-191)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_9
Dean JChambers CGrove DWall D(1995)Selective specialization for object-oriented languagesProceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation10.1145/207110.207119(93-102)Online publication date: 18-Jun-1995
https://dl.acm.org/doi/10.1145/207110.207119
Dean JChambers CKessler R(1994)Towards better inlining decisions using inlining trialsProceedings of the 1994 ACM conference on LISP and functional programming10.1145/182409.182489(273-282)Online publication date: 1-Jul-1994
https://dl.acm.org/doi/10.1145/182409.182489
Cooper KHall MKennedy K(1992)Procedure cloningProceedings of the 1992 International Conference on Computer Languages10.1109/ICCL.1992.185472(96-105)Online publication date: 1992
https://doi.org/10.1109/ICCL.1992.185472
Cooper KHall MKenneyd KTorczon L(2006)Interprocedural analysis and optimizationCommunications on Pure and Applied Mathematics10.1002/cpa.316048090348:9(947-1003)Online publication date: 18-Oct-2006
https://doi.org/10.1002/cpa.3160480903
Vahid F(2002)Partitioning sequential programs for CAD using a three-step approachACM Transactions on Design Automation of Electronic Systems10.1145/567270.5672737:3(413-429)Online publication date: 1-Jul-2002
https://dl.acm.org/doi/10.1145/567270.567273
Murphy BLam MLawall J(2000)Program analysis with partial transfer functionsProceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation10.1145/328690.328703(94-103)Online publication date: 1-Jan-2000
https://dl.acm.org/doi/10.1145/328690.328703
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.

Cited By

Index Terms

Recommendations

Singleton types here, singleton types there, singleton types everywhere

Qualified types for MLF

Qualified types for MLF