Article

Free access

Static and dynamic semantics processing

Authors:

Charles Consel,

Olivier DanvyAuthors Info & Claims

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 14 - 24

https://doi.org/10.1145/99583.99588

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

D. Bjorner, A. P. Ershov, and N. D. Jones, editors. Partial Evaluation and Mixed Computation. North- Holland, 1988.

Digital Library

Google Scholar

[2]

A. Bondorf. Automatic autoprojection of higher order recursive equations. In N. D. Jones, editor, ESOP'90, 3~a European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 70-87. Springer-Verlag, 1990.

Digital Library

Google Scholar

[3]

A. Bondorf and O. Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Diku Research Report 90/04, University of Copenhagen, Copenhagen, Denmark, 1990. To appear in Science of Computer Programming.

Digital Library

Google Scholar

[4]

A. Bondorf, N. D. Jones, T. Mogensen, and P. Sestoft. Binding time analysis and the taming of selfapplication. Diku report, University of Copenhagen, Copenhagen, Denmark, 1988.

Google Scholar

[5]

C. Coffsel. New insights into partial evaluation: the Schism experiment. In H. Ganzinger, editor, ESOP'88, 2nd European Symposium on Programming, volume 300 of Lecture Notes in Computer Science, pages 236-246. Springer-Verlag, 1988.

Digital Library

Google Scholar

[6]

C. Consel. Analyse de Programmes, Evaluation Partielle et Generation de Compilateurs. PhD thesis, Universit~ de Paris VI, Paris, France, 1989.

Google Scholar

[7]

C. Consel. Binding time analysis for higher order untyped functional languages. In A CM Conference on Lisp and Functional Programming, pages 264-272, 1990.

Digital Library

Google Scholar

[8]

C. Consel. The Schism Manual. Yale University, New Haven, Connecticut, USA, 1990. Version 1.0.

Google Scholar

[9]

C. Consel and O. Danvy. From interpreting to compilin bindin$ times, in N D Jones, editor, ESOP'90, European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 88-105. Springer-Verlag, 1990.

Crossref

Google Scholar

[10]

C. Consel and S. C. Khoo. Semantics-directed generation of a Prolog compiler. Research Report 781, Yale University, New IIaven, Connecticut, USA, 1990.

Google Scholar

[11]

O. Danvy. Semantics-directed compilation of non-linear patterns. Technical Report 303, Indiana University, Bloomington, Indiana, USA, 1990.

Google Scholar

[12]

A. P. Ershov, D. Bj0rner, Y. Futamura, K. Furukawa, A. Haraldsson, and W. L. Scherlis, editors. Selected Papers from the Workshop on Partial Evaluation and Mixed Computation, volume 6 of 2,3. OHMSHA. LTD. and Springer-Verlag, 1988.

Google Scholar

[13]

Y. Futamura. Partial evaluation of computation process- an approach to a compiler-compiler. Systems, Computers, Controls 2, 5, pages 45-50, 1971.

Google Scholar

[14]

H. Ganzinger and N. D. Jones, editors. Programs as Data Objects, volume 217 of Lecture Notes in Computer Science. Springer-Verlag, 1985.

Digital Library

Google Scholar

[15]

N. D. Jones. Challenging problems in partial evaluation and mixed computation. In {12}, pages 1-14.

Google Scholar

[16]

N. D. Jones, editor. Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science. Springer-Verlag, 1980.

Digital Library

Google Scholar

[17]

N. D. Jones, C. K. Gomard, A. Bondorf, O. Danvy, and T. Mogensen. A self-applicable partial evaluator for the lambda calculus. In IEEE International Conference on Computer Languages, pages 49-58, 1990.

Crossref

Google Scholar

[18]

N. D. Jones and S. S. Muchnick. Some thoughts towards the design of an ideal language. In A CM Conference on Principles of Programming Languages, pages 77-94, 1976.

Digital Library

Google Scholar

[19]

N. D. Jones, P. Sestoft, and If. S0ndergaard. An experiment in partial evaluation: the generation of a compiler generator. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, Dijon, France, volume 202 of Lecture Notes in Computer Science, pages 124-140. Springer-Verlag, 1985.

Digital Library

Google Scholar

[20]

N. D. Jones, P. Sestoft, and H. SCndergaard. Mix: a self-appficable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(x):9 z0, 19s9.

Google Scholar

[21]

R. Kesley and P. tIudak. Realistic compilation by program transformation. In A CM Symposium on Principles of Programming Languages, pages 281-292, 1989.

Digital Library

Google Scholar

[22]

D. A. Kranz, R. Kesley, J. A. Rees, P. Hudak, J. Philbin, and N. I. Adams. Orbit" an optimizing compiler for Scheme. SIGPLAN Notices, A CM Symposium on Compiler Construction, 21(7):219-233, 1986.

Digital Library

Google Scholar

[23]

P. Lee. Realistic Compiler Generation. MIT Press, 1989.

Digital Library

Google Scholar

[24]

M. Montenyohl and M. Wand. Correct flow analysis in continuation semantics. In A CM Symposium on Principles of Programming Languages, pages 204-218, 1988.

Digital Library

Google Scholar

[25]

F. L. Morris. The next 700 formal language descriptions. Unpublished paper, 1970.

Google Scholar

[26]

P. Mosses. SIS- Semantics implementation System, reference manual and user guide. University of Aarhus, Aarhus, Denmark, 1979. Version 1.0.

Google Scholar

[27]

H. R. Nielson and F. Nielson. Automatic binding time analysis for a typed A-calculus. In A CM Symposium on Principles of Programming Languages, pages 98-106, 1988.

Digital Library

Google Scholar

[28]

It. R. Nielson and F. Nielson. The TML-approach to compiler-compilers. Technical Report 88-47, Technical University of Denmark, Lyngby, Denmark, 1988.

Google Scholar

[29]

L. Paulson. A semantics-directed compiler generator. In A GM Symposium on Principles o} Programming Lan. guages, pages 224-233, 1982.

Digital Library

Google Scholar

[30]

U. Pleban. Semantics-directed compiler generation. In A GM Symposium on Principles of Programming Languages, 1987. Tutorial.

Google Scholar

[31]

J. Rees and W. Cringer. Revised3 report on the algorithmic language Scheme. SIGPLAN Notices, 21(X2):37-79, 1986.

Digital Library

Google Scholar

[32]

J. Reynolds. Definitional interpreters for higher order programming languages. In A CM National Conference, pages 717-740, 1971.

Digital Library

Google Scholar

[33]

J. Reynolds. The essence of Algol. In Van Vliet, editor, International Symposium on Algorithmic Languages, pages 345-372. North-Holland, 1981.

Google Scholar

[34]

D. A. Schmidt. Detecting global variables in denotational specification. A CM Transactions on Programruing Languages and Systems, 7(2):299-310, 1985.

Digital Library

Google Scholar

[35]

D. A. Schmidt. Denotational Semantics: a Methodology for Language Development. Allyn and Bacon, Inc., 1986.

Digital Library

Google Scholar

[36]

P. Sestoft. The structure of a self-applicable partial evaluator. In {14}, pages 236-256.

Digital Library

Google Scholar

[37]

J. Stoy. Denotational Semantics: the Scott-Strachey approach to programming languages theory. MIT Press, 1977.

Digital Library

Google Scholar

[38]

M. Wand. Deriving target code as a representation of continuation semantics. A CM Transactions on Programming Languages and Systems, 4(3):496-517, 1982.

Digital Library

Google Scholar

[39]

M. Wand. A semantic prototyping system. SIGPLAN Notices, A CM Symposium on Compiler Construction, 19(6):213-221, 1984.

Digital Library

Google Scholar

[40]

M. Wand and Z. Wang. Conditional lambda-theories and the verification of static properties of programs. In IEEE Symposium on Logic in Computer Science, pages 321-332, 1990.

Crossref

Google Scholar

Cited By

View all

Адамович ИКлимов Ю(2022)Efficiency Investigation of BT-Object Based Partial Evaluation of Interpreters Written in the Java Object-Oriented LanguageProgram Systems: Theory and ApplicationsПрограммные системы: теория и приложения10.25209/2079-3316-2022-13-4-111-13713:4(111-137)Online publication date: 2022
https://doi.org/10.25209/2079-3316-2022-13-4-111-137
Cámara JMoreno GGarlan DSchmerl B(2016)Analyzing Latency-Aware Self-Adaptation Using Stochastic Games and SimulationsACM Transactions on Autonomous and Adaptive Systems10.1145/277422210:4(1-28)Online publication date: 13-Jan-2016
https://dl.acm.org/doi/10.1145/2774222
Luh RMarschalek SKaiser MJanicke HSchrittwieser S(2016)Semantics-aware detection of targeted attacks: a surveyJournal of Computer Virology and Hacking Techniques10.1007/s11416-016-0273-313:1(47-85)Online publication date: 2-May-2016
https://doi.org/10.1007/s11416-016-0273-3
Show More Cited By

Index Terms

Static and dynamic semantics processing
1. Software and its engineering
  1. Software notations and tools
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics
      1. Denotational semantics

Recommendations

Methods for specifying static semantics

The formal specification of a programming language involves the specification of three types of rules: syntax, static semantics and semantics. Various methods have been proposed for specifying the static semantic rules of programming languages, but as ...
On extracting static semantics
The essence of computation

We examine the problem of automatically extracting a static semantics from a language's semantic definition. Traditional approaches require manual construction of static and dynamic semantics, followed by a proof that the two are consistent. As languages ...
Combined Static and Dynamic Analysis

Static analysis is usually faster than dynamic analysis but less precise. Therefore it is often desirable to retain information from static analysis for run-time verification, or to compare the results of both techniques. However, this requires writing ...

Comments

Information & Contributors

Information

Published In

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1991

366 pages

ISBN:0897914198

DOI:10.1145/99583

Chairman:
David Wise
Indiana Univ., Bloomington

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: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL91

Sponsor:

POPL91: 18th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages

January 21 - 23, 1991

Florida, Orlando, USA

Acceptance Rates

POPL '91 Paper Acceptance Rate 31 of 152 submissions, 20%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
623
Total Downloads

Downloads (Last 12 months)66
Downloads (Last 6 weeks)13

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Адамович ИКлимов Ю(2022)Efficiency Investigation of BT-Object Based Partial Evaluation of Interpreters Written in the Java Object-Oriented LanguageProgram Systems: Theory and ApplicationsПрограммные системы: теория и приложения10.25209/2079-3316-2022-13-4-111-13713:4(111-137)Online publication date: 2022
https://doi.org/10.25209/2079-3316-2022-13-4-111-137
Cámara JMoreno GGarlan DSchmerl B(2016)Analyzing Latency-Aware Self-Adaptation Using Stochastic Games and SimulationsACM Transactions on Autonomous and Adaptive Systems10.1145/277422210:4(1-28)Online publication date: 13-Jan-2016
https://dl.acm.org/doi/10.1145/2774222
Luh RMarschalek SKaiser MJanicke HSchrittwieser S(2016)Semantics-aware detection of targeted attacks: a surveyJournal of Computer Virology and Hacking Techniques10.1007/s11416-016-0273-313:1(47-85)Online publication date: 2-May-2016
https://doi.org/10.1007/s11416-016-0273-3
Dulman SPauwels E(2015)Self-Stabilized Fast Gossiping AlgorithmsACM Transactions on Autonomous and Adaptive Systems10.1145/281681910:4(1-20)Online publication date: 31-Dec-2015
https://dl.acm.org/doi/10.1145/2816819
Marlet R(2013)BibliographyProgram Specialization10.1002/9781118576984.biblio(487-522)Online publication date: 5-Feb-2013
https://doi.org/10.1002/9781118576984.biblio
Li XCao HChen ETian J(2012)Learning to Infer the Status of Heavy-Duty Sensors for Energy-Efficient Context-SensingACM Transactions on Intelligent Systems and Technology10.1145/2089094.20891113:2(1-23)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1145/2089094.2089111
Liu SZhou MPan SSong YQian WCai WLian X(2012)TIARAACM Transactions on Intelligent Systems and Technology10.1145/2089094.20891013:2(1-28)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1145/2089094.2089101
Schneider FMenon VShpeisman TAdl-Tabatabai A(2008)Dynamic optimization for efficient strong atomicityACM SIGPLAN Notices10.1145/1449955.144977943:10(181-194)Online publication date: 19-Oct-2008
https://dl.acm.org/doi/10.1145/1449955.1449779
Xian FSrisa-an WJiang H(2008)Contention-aware schedulerACM SIGPLAN Notices10.1145/1449955.144977843:10(163-180)Online publication date: 19-Oct-2008
https://dl.acm.org/doi/10.1145/1449955.1449778
Bondorf APalsberg J(2008)Generating action compilers by partial evaluationJournal of Functional Programming10.1017/S09567968000016846:02(269-298)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001684
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

Methods for specifying static semantics

On extracting static semantics

Combined Static and Dynamic Analysis