Constructing call-by-value continuation semantics

Ravi Sethi, Adrian Tang

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

1 Scopus citations

Abstract

The primary motivation behind this paper is an interest in transforming one semantic description for a language into another related description of the same language. Since direct and continuation semantics have been studied in some detail, they are obvious test-beds for suggesting the problems that might be encountered in the process. One of the problems is that the semantic objects in two descriptions of a language may be quite dissimilar. For example, function values of procedures in direct semantics are quite different from function values in continuation semantics. Milne and Reynolds have defined predicates which can be used to relate the two kinds of function values. Starting with such predicates we define transformations and then show that the transformations preserve the predicates. The transformations are used to construct continuation semantics, starting from a direct semantics of a language with procedures called by value.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 6th Colloquium
EditorsHermann A. Maurer
PublisherSpringer-Verlag
Pages556-570
Number of pages15
ISBN (Print)9783540095101
DOIs
StatePublished - Jan 1 1979
Externally publishedYes
Event6th International Colloquium on Automata, Languages and Programming, ICALP 1979 - Graz, Austria
Duration: Jul 16 1979Jul 20 1979

Publication series

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

Other

Other6th International Colloquium on Automata, Languages and Programming, ICALP 1979
CountryAustria
CityGraz
Period7/16/797/20/79

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Constructing call-by-value continuation semantics'. Together they form a unique fingerprint.

  • Cite this

    Sethi, R., & Tang, A. (1979). Constructing call-by-value continuation semantics. In H. A. Maurer (Ed.), Automata, Languages and Programming - 6th Colloquium (pp. 556-570). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 71 LNCS). Springer-Verlag. https://doi.org/10.1007/3-540-09510-1_45