Compiler optimizations for low-level redundancy elimination: An application of meta-level Prolog primitives

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Much of the work on applications of meta-level primitives in logic programs focusses on high-level aspects such as source-level program transformation, interpretation, and partial evaluation. In this paper, we show how meta-level primitives can be used in a very simple way for low-level code optimization in compilers. The resulting code optimizer is small, simple, efficient, and easy to modify and retarget. An optimizer based on these ideas is currently being used in a compiler that we have developed for Janus [6].

Original languageEnglish (US)
Title of host publicationMeta-Programming in Logic - 3rd International Workshop, META-1992, Proceedings
PublisherSpringer Verlag
Pages120-134
Number of pages15
Volume649 LNCS
ISBN (Print)9783540562825
StatePublished - 1992
Event3rd International Workshop on Meta-Programming in Logic, META 1992 - Uppsala, Sweden
Duration: Jun 10 1992Jun 12 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume649 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Workshop on Meta-Programming in Logic, META 1992
CountrySweden
CityUppsala
Period6/10/926/12/92

Fingerprint

Compiler Optimization
Prolog
Compiler
Redundancy
Elimination
Partial Evaluation
Program Transformation
Logic Programs
Optimization
Interpretation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Debray, S. K. (1992). Compiler optimizations for low-level redundancy elimination: An application of meta-level Prolog primitives. In Meta-Programming in Logic - 3rd International Workshop, META-1992, Proceedings (Vol. 649 LNCS, pp. 120-134). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 649 LNCS). Springer Verlag.

Compiler optimizations for low-level redundancy elimination : An application of meta-level Prolog primitives. / Debray, Saumya K.

Meta-Programming in Logic - 3rd International Workshop, META-1992, Proceedings. Vol. 649 LNCS Springer Verlag, 1992. p. 120-134 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 649 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Debray, SK 1992, Compiler optimizations for low-level redundancy elimination: An application of meta-level Prolog primitives. in Meta-Programming in Logic - 3rd International Workshop, META-1992, Proceedings. vol. 649 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 649 LNCS, Springer Verlag, pp. 120-134, 3rd International Workshop on Meta-Programming in Logic, META 1992, Uppsala, Sweden, 6/10/92.
Debray SK. Compiler optimizations for low-level redundancy elimination: An application of meta-level Prolog primitives. In Meta-Programming in Logic - 3rd International Workshop, META-1992, Proceedings. Vol. 649 LNCS. Springer Verlag. 1992. p. 120-134. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Debray, Saumya K. / Compiler optimizations for low-level redundancy elimination : An application of meta-level Prolog primitives. Meta-Programming in Logic - 3rd International Workshop, META-1992, Proceedings. Vol. 649 LNCS Springer Verlag, 1992. pp. 120-134 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6cdb035c409b4d49be8673eb937f13b8,
title = "Compiler optimizations for low-level redundancy elimination: An application of meta-level Prolog primitives",
abstract = "Much of the work on applications of meta-level primitives in logic programs focusses on high-level aspects such as source-level program transformation, interpretation, and partial evaluation. In this paper, we show how meta-level primitives can be used in a very simple way for low-level code optimization in compilers. The resulting code optimizer is small, simple, efficient, and easy to modify and retarget. An optimizer based on these ideas is currently being used in a compiler that we have developed for Janus [6].",
author = "Debray, {Saumya K}",
year = "1992",
language = "English (US)",
isbn = "9783540562825",
volume = "649 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "120--134",
booktitle = "Meta-Programming in Logic - 3rd International Workshop, META-1992, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Compiler optimizations for low-level redundancy elimination

T2 - An application of meta-level Prolog primitives

AU - Debray, Saumya K

PY - 1992

Y1 - 1992

N2 - Much of the work on applications of meta-level primitives in logic programs focusses on high-level aspects such as source-level program transformation, interpretation, and partial evaluation. In this paper, we show how meta-level primitives can be used in a very simple way for low-level code optimization in compilers. The resulting code optimizer is small, simple, efficient, and easy to modify and retarget. An optimizer based on these ideas is currently being used in a compiler that we have developed for Janus [6].

AB - Much of the work on applications of meta-level primitives in logic programs focusses on high-level aspects such as source-level program transformation, interpretation, and partial evaluation. In this paper, we show how meta-level primitives can be used in a very simple way for low-level code optimization in compilers. The resulting code optimizer is small, simple, efficient, and easy to modify and retarget. An optimizer based on these ideas is currently being used in a compiler that we have developed for Janus [6].

UR - http://www.scopus.com/inward/record.url?scp=85007365607&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85007365607&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85007365607

SN - 9783540562825

VL - 649 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 120

EP - 134

BT - Meta-Programming in Logic - 3rd International Workshop, META-1992, Proceedings

PB - Springer Verlag

ER -