A Type-Directed, Dictionary-Passing Translation of Method Overloading and Structural Subtyping in Featherweight Generic Go
Authors:
- Martin SulzmannMSMartin Sulzmann
- Stefan WehrSWStefan Wehr
Preprint
Abstract
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. FGG- includes all features of FGG but type assertions. 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 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.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Generic go to go: dictionary-passing, monomorphisation, and hybridProceedings of the ACM on Programming Languages, 2022
- Compiling with continuations, correctlyProceedings of the ACM on Programming Languages, 2021
- Coherence of type class resolutionProceedings of the ACM on Programming Languages, 2019
- A bisimulation for type abstraction and recursionJournal of the ACM, 2007
- Syntactic Logical Relations for Polymorphic and Recursive TypesElectronic Notes in Theoretical Computer Science, 2007
- An indexed model of recursive types for foundational proof-carrying codeACM Transactions on Programming Languages and Systems, 2001
- Type classes in HaskellACM Transactions on Programming Languages and Systems, 1996
- Logical relations and the typed λ-calculusInformation and Control, 1985
- Intensional interpretations of functionals of finite type IThe Journal of Symbolic Logic, 1967