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

Related topics

Related topics

9 relations
Bounded quantifierPOPLmark challengeParametric polymorphismProgramming language theory
Expand

Broader (3)

Functional programmingLambda calculusType theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Type soundness proofs with definitional interpreters
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
2016
2016
Dependent Object Types
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
2015
2015
From F to DOT: Type Soundness Proofs with Definitional Interpreters
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
2015
2015
Mechanizing type environments in weak HOAS
We provide a paradigmatic case study, about the formalization of System F < : 's type language in the proof assistant Coq. Our… Expand
2012
2012
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
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
2009
2009
Bidirectional polymorphism through greed and unions
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
2006
2006
A Comparison between Concrete Representations for Bindings Extended
Many representations of term syntax with variable bindings have been used to formalize programming language metatheory, but so… Expand
Highly Cited
2005
Highly Cited
2005
Mechanized Metatheory for the Masses: The PoplMark Challenge
How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machine… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE