Featherweight Go

05/24/2020
by   Robert Griesemer, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2017

Deadlock detection of Java Bytecode

This paper presents a technique for deadlock detection of Java programs....
research
01/28/2021

Compact Java Monitors

For scope and context, the idea we'll describe below, Compact Java Monit...
research
07/19/2022

To what extent can we analyze Kotlin programs using existing Java taint analysis tools? (Extended Version)

As an alternative to Java, Kotlin has gained rapid popularity since its ...
research
05/19/2010

Groebner bases in Java with applications in computer graphics

In this paper we present a Java implementation of the algorithm that com...
research
10/19/2021

Java Card Virtual Machine Memory Organization: a Design Proposal

The Java Card Virtual Machine (JCVM) platform is widely deployed on secu...
research
09/08/2017

Java Extensions for OMNeT++

On the one side, network simulation frameworks are important tools for r...
research
01/15/2018

Java & Lambda: a Featherweight Story

We present FJ&Lambda, a new core calculus that extends Featherweight Jav...

Please sign up or login with your details

Forgot password? Click here to reset