Pith. sign in

REVIEW

Featherweight Go

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.11710 v4 pith:D4KU5QE2 submitted 2020-05-24 cs.PL cs.LO

Robert Griesemer , Raymond Hu , Wen Kokke , Julien Lange , Ian Lance Taylor , Bernardo Toninho , Philip Wadler , Nobuko Yoshida This is my paper · ORCID
classification cs.PLcs.LO
keywords javadesignfeatherweightgenericsmonomorphisationwhereasalthoughdefined
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We describe a design for generics in Go inspired by previous work on Featherweight Java by Igarashi, Pierce, and Wadler. Whereas subtyping in Java is nominal, in Go it is structural, and whereas generics in Java are defined via erasure, in Go we use monomorphisation. Although monomorphisation is widely used, we are one of the first to formalise it. Our design also supports a solution to The Expression Problem.

Discussion (0). Continue with ORCID to comment.

Pith tools