Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2016
2016
We propose a new type-theoretic foundation of Scala and languages like it: the Dependent Object Types (DOT) calculus. DOT models… Expand
  • table 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
2015
2015
Scala's type system unifies ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT) family of… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
2015
2015
We provide a paradigmatic case study, about the formalization of System F < : 's type language in the proof assistant Coq. Our… Expand
Is this relevant?
2012
2012
This paper presents GMeta: a generic framework for first-order representations of variable binding that provides once and for all… Expand
  • figure 1
  • figure 3
  • figure 7
  • figure 10
  • figure 11
Is this relevant?
2009
2009
Bidirectional typechecking has become popular in advanced type systems because it works in many situations where inference is… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2006
2006
Many representations of term syntax with variable bindings have been used to formalize programming language metatheory, but so… Expand
Is this relevant?
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… Expand
Is this relevant?