Generic go to go: dictionary-passing, monomorphisation, and hybrid

Ellis, S.; Zhu, Shuofei; Yoshida, N.; Song, Linhai

doi:10.1145/3563331

Cited by 3 publications

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Go cannot express this scenario without falling back to dynamic type assertions. Ellis et al (2022) formalize a dictionary-passing translation from a restricted subset of FGG to FG. The restriction for FGG is the same as previously explained for full Go: a method declaration must have the same type bounds as its receiver struct.…”

Section: Generics In Gomentioning

confidence: 99%

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

Section: Generics In Gomentioning

confidence: 99%

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

show abstract

Extending Isabelle/HOL’s Code Generator with Support for the Go Programming Language

Stübinger,

Hupel

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The Isabelle proof assistant includes a small functional language, which allows users to write and reason about programs. So far, these programs could be extracted into a number of functional languages: Standard ML, OCaml, Scala, and Haskell. This work adds support for Go as a fifth target language for the Code Generator. Unlike the previous targets, Go is not a functional language and encourages code in an imperative style, thus many of the features of Isabelle’s language (particularly data types, pattern matching, and type classes) have to be emulated using imperative language constructs in Go. The developed Code Generation is provided as an add-on library that can be simply imported into existing theories.

show abstract

Generic go to go: dictionary-passing, monomorphisation, and hybrid

Ellis

Zhu

Yoshida

et al. 2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Go is a popular statically-typed industrial programming language. To aid the type safe reuse of code, the recent Go release (Go 1.18) published early 2022 includes bounded parametric polymorphism via generic types. Go 1.18 implements generic types using a combination of monomorphisation and call-graph based dictionary-passing called hybrid. This hybrid approach can be viewed as an optimised form of monomorphisation that statically generates specialised methods and types based on possible instantiations. A monolithic dictionary supplements information lost during monomorphisation, and is structured according to the program’s call graph. Unfortunately, the hybrid approach still suffers from code bloat, poor compilation speed, and limited code coverage. In this paper we propose and formalise a new non-specialising call-site based dictionary-passing translation. Our call-site based translation creates individual dictionaries for each type parameter, with dictionary construction occurring in place of instantiation, overcoming the limitations of hybrid. We prove it correct using a novel and general bisimulation up to technique. To better understand how different generics translation approaches work in practice, we benchmark five translators, Go 1.18, two existing monomorphisation translators, our dictionary-passing translator, and an erasure translator. Our findings reveal several suggestions for improvements for Go 1.18— specifically how to overcome the expressiveness limitations of generic Go and improve compile time and compiled code size performance of Go 1.18.

show abstract

Generic go to go: dictionary-passing, monomorphisation, and hybrid

Cited by 3 publications

References 24 publications

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

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

Extending Isabelle/HOL’s Code Generator with Support for the Go Programming Language

Generic go to go: dictionary-passing, monomorphisation, and hybrid

Contact Info

Product

Resources

About