Document Open Access Logo

KafKa: Gradual Typing for Objects (Artifact)

Authors Benjamin Chung, Paley Li, Francesco Zappa Nardelli, Jan Vitek

PDF

Artifact Description

Thumbnail PDF
PDF
DARTS.4.3.10.pdf
  • Filesize: 334 kB
  • 3 pages

Document Identifiers

Subject Classification

Keywords
  • Gradual typing
  • object-orientation
  • language design
  • type systems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

A wide range of gradual type systems have been proposed, providing many
languages with the ability to mix typed and untyped code. However, hiding
under language details, these gradual type systems have fundamentally
different ideas of what it means to be typed. In this paper, we show that
four of the most common gradual type systems provide distinct guarantees,
and we give a formal framework for comparing gradual type systems for
object-oriented languages. First, we show that the different gradual type
systems are practically distinguishable via a three-part litmus test. Then,
we present a formal framework for defining and comparing gradual type
systems. Within this framework, different gradual type systems become
translations between a common source and target language, allowing for
direct comparison of semantics and guarantees.

Cite As Get BibTex

Benjamin Chung, Paley Li, Francesco Zappa Nardelli, and Jan Vitek. KafKa: Gradual Typing for Objects (Artifact). In Special Issue of the 32nd European Conference on Object-Oriented Programming (ECOOP 2018). Dagstuhl Artifacts Series (DARTS), Volume 4, Issue 3, pp. 10:1-10:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/DARTS.4.3.10

Author Details

Benjamin Chung
Paley Li
Francesco Zappa Nardelli
Jan Vitek

Artifact

  MD5 Sum: 5186a2242726e810f5acac714a827a6c (Get MD5 Sum)

Related Article

  • Benjamin Chung, Paley Li, Francesco Zappa Nardelli, and Jan Vitek, "KafKa: Gradual Typing for Objects", in 32nd European Conference on Object-Oriented Programming (ECOOP 2018), LIPIcs, Vol. 109, pp. 12:1-12:25, 2018. https://doi.org/10.4230/LIPIcs.ECOOP.2018.12

References

  1. Timothy Jones and David J. Pearce. A mechanical soundness proof for subtyping over recursive types. In Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs, FTfJP'16, pages 1:1-1:6, New York, NY, USA, 2016. ACM. URL: http://doi.acm.org/10.1145/2955811.2955812, URL: http://dx.doi.org/10.1145/2955811.2955812.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact