Category-sorted algebra-based action semantics

Even, Susan; Schmidt, David A.

doi:10.1016/0304-3975(90)90116-y

Cited by 10 publications

(15 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Doh's prototyping system, based on a category-sorted algebraic model for action semantics [4], extracts a binding-time semantics from an action-semantic description. It generates a syntax-directed translator that translates the source program to a program action annotated with binding-time information.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Action transformations in the actress compiler generator

Moura¹,

Watt

1994

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Section: Resultsmentioning

confidence: 99%

“…store the value in cell(i,4) hence ... the value stored in ce11 (1,4) We define an action to be statically scoped if, for every applied occurrence of an identifier k in the action, we can uniquely identify the 'bind' action that produced the current binding of k.…”

Section: Binding Eliminationmentioning

confidence: 99%

Action transformations in the actress compiler generator

Moura¹,

Watt

1994

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Several such constructions exist, e.g., by Oles [33], and by Even and Schmidt [10], but they are quite complicated.…”

Section: Semantic Valuesmentioning

confidence: 99%

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation

Danvy¹,

Vestergaard²

1996

BRICS

View full text Add to dashboard Cite

We illustrate a simple and effective solution to semantics-based compiling. Our solution is based on type-directed partial evaluation, where• our compiler generator is expressed in a few lines, and is efficient;• its input is a well-typed, purely functional definitional interpreter in the manner of denotational semantics; • the output of the generated compiler is three-address code, in the fashion and efficiency of the Dragon Book; • the generated compiler processes several hundred lines of source code per second.The source language considered in this case study is imperative, blockstructured, higher-order, call-by-value, allows subtyping, and obeys stack discipline. It is bigger than what is usually reported in the literature on semantics-based compiling and partial evaluation. Our compiling technique uses the first Futamura projection, i.e., we compile programs by specializing a definitional interpreter with respect to this program.Our definitional interpreter is completely straightforward, stackbased, and in direct style. In particular, it requires no clever staging technique (currying, continuations, binding-time improvements, etc.), nor does it rely on any other framework (attribute grammars, annotations, etc.) than the typed λ-calculus. In particular, it uses no other program analysis than traditional type inference.The overall simplicity and effectiveness of the approach has encouraged us to write this paper, to illustrate this genuine solution to denotational semantics-directed compilation, in the spirit of Scott and

show abstract

“…If such properties hold, we say that the typing scheme is sound and complete, respectively. In [5], we showed the proof of soundness and completeness of a method of type inference for action semantics expressions. In this section, we give the algorithms that implement the method.…”

Section: Type Inference Of Action Expressionsmentioning

confidence: 99%

“…In our recent work [5], we studied a combinator-based version of action semantics. We developed a typing system for actions based on types and k/nds.…”

Section: Introductionmentioning

confidence: 99%