Toward a Mechanized Compendium of Gradual Typing

by   Jeremy G. Siek, et al.

The research on gradual typing has grown considerably over the last decade, with more than 150 papers in the Gradual Typing Bibliography. There are a large number of alternative language designs that have been proposed and there are many interesting approaches for addressing the efficiency challenges. To better understand and categorize a central portion of the research on gradual typing, this article begins the development of a compendium of gradual typing, mechanized using the Agda proof assistant. This article identifies abstractions that capture similarities between many cast calculi, thereby enabling the reuse of definitions and theorems across different designs for many gradually typed languages.


page 1

page 2

page 3

page 4


Formalization, Mechanization and Automation of Gödel's Proof of God's Existence

Gödel's ontological proof has been analysed for the first-time with an u...

Liberating language research from dogmas of the 20th century

A commentary on the article "Large-scale evidence of dependency length m...

Gradual Type Theory (Extended Version)

Gradually typed languages are designed to support both dynamically typed...

Data Management in Networked Industrial Environments: State of the Art and Open Challenges

Information and communication technologies are permeating all aspects of...

Central Limit Theorems and Approximation Theory: Part II

In Part I of this article (Banerjee and Kuchibhotla (2023)), we have int...

On an Unknown Ancestor of Burrows' Delta Measure

This article points out some surprising similarities between a 1944 stud...

Applying graph matching techniques to enhance reuse of plant design information

This article investigates how graph matching can be applied to process p...

Please sign up or login with your details

Forgot password? Click here to reset