September 24, 2020 Software Open Access

Griesemer, Robert; Hu, Raymond; Kokke, Wen; Lange, Julien; Taylor, Ian Lance; Toninho, Bernardo; Wadler, Philip; Yoshida, Nobuko

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.4048298</identifier>
  <creators>
    <creator>
      <creatorName>Griesemer, Robert</creatorName>
      <givenName>Robert</givenName>
      <familyName>Griesemer</familyName>
      <affiliation>Google</affiliation>
    </creator>
    <creator>
      <creatorName>Hu, Raymond</creatorName>
      <givenName>Raymond</givenName>
      <familyName>Hu</familyName>
      <affiliation>University of Hertfordshire</affiliation>
    </creator>
    <creator>
      <creatorName>Kokke, Wen</creatorName>
      <givenName>Wen</givenName>
      <familyName>Kokke</familyName>
      <affiliation>University of Edinburgh</affiliation>
    </creator>
    <creator>
      <creatorName>Lange, Julien</creatorName>
      <givenName>Julien</givenName>
      <familyName>Lange</familyName>
      <affiliation>Royal Holloway, University of London</affiliation>
    </creator>
    <creator>
      <creatorName>Taylor, Ian Lance</creatorName>
      <givenName>Ian Lance</givenName>
      <familyName>Taylor</familyName>
      <affiliation>Google</affiliation>
    </creator>
    <creator>
      <creatorName>Toninho, Bernardo</creatorName>
      <givenName>Bernardo</givenName>
      <familyName>Toninho</familyName>
      <affiliation>Universidade Nova de Lisboa and NOVA-LINCS</affiliation>
    </creator>
    <creator>
      <creatorName>Wadler, Philip</creatorName>
      <givenName>Philip</givenName>
      <familyName>Wadler</familyName>
      <affiliation>University of Edinburgh</affiliation>
    </creator>
    <creator>
      <creatorName>Yoshida, Nobuko</creatorName>
      <givenName>Nobuko</givenName>
      <familyName>Yoshida</familyName>
      <affiliation>Imperial College London</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Featherweight Go (Artifact)</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2020</publicationYear>
  <subjects>
    <subject>Go</subject>
    <subject>Generics</subject>
    <subject>Monomorphisation</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2020-09-24</date>
  </dates>
  <language>en</language>
  <resourceType resourceTypeGeneral="Software"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/4048298</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.4048297</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode">Creative Commons Attribution Non Commercial No Derivatives 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;This paper presents Featherweight Go (FG) and Featherweight Generic Go (FGG), a core calculus of Go and a proposal for extending it with F-bounded polymorphism. The calculi are in the same vein as Featherweight Java (FJ), but where Featherweight Generic Java (FGJ) was translated into FJ via erasure, FGG translates into FG via monomorphization (which is also formalized). The two calculi are proven sound using the normal progress and preservation arguments. Additionally a bisimulation is shown to exist between a FGG program and its monomorphization (if it exists); in other words that monomorphization preserves the semantics of the program.&lt;br&gt;
&lt;br&gt;
The artifact consists of an implementation of type checkers and interpreters for FG and FGG, as well as a monomorphization procedure (including the check if it is possible). It includes the examples from the paper, and a comparison using the Go compiler as reference. Type preservation and bisimulation for these programs are tested dynamically. Additionally, the same is tested for all well-typed programs up to a certain size (which are generated in a manner similar to property-based testing).&lt;/p&gt;</description>
  </descriptions>
</resource>