Semantic Preservation for a Type Directed Translation Scheme of Featherweight Go

Sulzmann, Martin; Wehr, Stefan

doi:10.1007/978-3-031-16912-0_7

Cited by 2 publications

(10 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our own work published at APLAS (Sulzmann and Wehr, 2021) and MPC (Sulzmann and Wehr, 2022) laid the foundations for the dictionary-passing translation and its correctness proof of the present article. For the APLAS paper, we defined a dictionary-passing translation for Featherweight Go (FG, Griesemer et al, 2020), the non-generic variant of FGG.…”

Section: Prior Workmentioning

confidence: 91%

“…Often, logical relations are defined by induction on the structure of types. In our case, this approach does not work because interface types in FGG might be recursive, see our previous work (Sulzmann and Wehr, 2022) for an example. Thus, we use the step index as part of a decreasing measure M. Writing | | for the size of some target value , we define M ( ≈ ∈ ) = ( , 1, 0) and M ( ≡ ∈ ) = ( , 0, | |).…”

Section: Methods Dictionary Entriesmentioning

confidence: 98%

“…The diagram in Figure 17 summarizes the existing translations by Griesemer et al (OOPSLA 2020), by Ellis et al (OOPSLA 2022), from our MPC 2022 paper (Sulzmann and Wehr, 2022), and from the article at hand. The three resulting target language programs TL , ′ TL , and ′′ TL are semantically equivalent because all translations preserve the dynamic semantics.…”

Section: Summary Of Translationsmentioning

confidence: 97%

“…Whether we have < in EQUIV-IFACE and ≤ in EQUIV-METHOD-DICT-ENTRY or vice versa is a matter of taste. In our previous work at MPC (Sulzmann and Wehr, 2022), we established a dictionary-passing translation for Featherweight Go without generics. The situation is slightly different there.…”

Section: Getting the Step Index Rightmentioning

confidence: 99%

“…Besides structured data and functions, we need to cover recursive interface values. This leads to some challenges to get the step index right (Sulzmann and Wehr, 2022).…”

Section: Logical Relationsmentioning

confidence: 99%

See 4 more Smart Citations

A Type-Directed, Dictionary-Passing Translation of Featherweight Generic Go

Sulzmann¹,

Wehr²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Featherweight Generic Go (FGG) is a minimal core calculus modeling the essential features of the programming language Go. It includes support for overloaded methods, interface types, structural subtyping and generics. The most straightforward semantic description of the dynamic behavior of FGG programs is to resolve method calls based on runtime type information of the receiver.This article shows a different approach by defining a type-directed translation from FGG to an untyped lambda-calculus. The translation of an FGG program provides evidence for the availability of methods as additional dictionary parameters, similar to the dictionary-passing approach known from Haskell type classes. Then, method calls can be resolved by a simple lookup of the method definition in the dictionary.Every program in the image of the translation has the same dynamic semantics as its source FGG program. The proof of this result is based on a syntactic, step-indexed logical relation. The stepindex ensures a well-founded definition of the relation in the presence of recursive interface types and recursive methods.

show abstract

Section: Prior Workmentioning

confidence: 91%

Section: Methods Dictionary Entriesmentioning

confidence: 98%

Section: Summary Of Translationsmentioning

confidence: 97%

Section: Getting the Step Index Rightmentioning

confidence: 99%

“…Besides structured data and functions, we need to cover recursive interface values. This leads to some challenges to get the step index right (Sulzmann and Wehr, 2022).…”

Section: Logical Relationsmentioning

confidence: 99%

See 3 more Smart Citations

A Type-Directed, Dictionary-Passing Translation of Featherweight Generic Go

Sulzmann¹,

Wehr²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go

SULZMANN,

WEHR

2023

J. Funct. Prog.

View full text Add to dashboard Cite

Featherweight Generic Go (FGG) is a minimal core calculus modeling the essential features of the programming language Go. It includes support for overloaded methods, interface types, structural subtyping, and generics. The most straightforward semantic description of the dynamic behavior of FGG programs is to resolve method calls based on runtime type information of the receiver. This article shows a different approach by defining a type-directed translation from ${\textrm{FGG}^{-}}$ to an untyped lambda-calculus. ${\textrm{FGG}^{-}}$ includes all features of FGG but type assertions. The translation of an ${\textrm{FGG}^{-}}$ program provides evidence for the availability of methods as additional dictionary parameters, similar to the dictionary-passing approach known from Haskell type classes. Then, method calls can be resolved by a simple lookup of the method definition in the dictionary. Every program in the image of the translation has the same dynamic semantics as its source ${\textrm{FGG}^{-}}$ program. The proof of this result is based on a syntactic, step-indexed logical relation. The step index ensures a well-founded definition of the relation in the presence of recursive interface types and recursive methods. Although being non-deterministic, the translation is coherent.

show abstract

Semantic Preservation for a Type Directed Translation Scheme of Featherweight Go

Cited by 2 publications

References 21 publications

A Type-Directed, Dictionary-Passing Translation of Featherweight Generic Go

A Type-Directed, Dictionary-Passing Translation of Featherweight Generic Go

A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go

Contact Info

Product

Resources

About