System F-sub

In the branch of mathematical logic known as type theory, System F<:, pronounced "F-sub", is an extension of system F with subtyping. System F&lt…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to…

2016

We propose a new type-theoretic foundation of Scala and languages like it: the Dependent Object Types (DOT) calculus. DOT models…

2015

Scala's type system unifies ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT) family of…

2015

2012

This paper presents GMeta: a generic framework for first-order representations of variable binding that provides once and for all…

2009

Bidirectional typechecking has become popular in advanced type systems because it works in many situations where inference is…

2006

Many representations of term syntax with variable bindings have been used to formalize programming language metatheory, but so…

Highly Cited

2005

Highly Cited

2005

How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machine…