FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2005-2014
01220052014

Related topics

Related topics

9 relations
Bounded quantifierPOPLmark challengeParametric polymorphismProgramming language theory
(More)

Broader (3)

Functional programmingLambda calculusType theory

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
System F-sub
Functional programming
Lambda calculus
Type theory
Parametric polymorphism
System F

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
From F to DOT: Type Soundness Proofs with Definitional Interpreters
Scala’s type system unifies aspects of ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
2015
2015
A Solution to the PoplMark Challenge in Isabelle / HOL
We present a solution to the PoplMark challenge designed by Aydemir et al., which has as a goal the formalization of the… (More)
Is this relevant?
2014
2014
A Solution to the PoplMark Challenge in Isabelle / HOL
  • Stefan Berghofer August
  • 2014
We present a solution to the PoplMark challenge designed by Aydemir et al., which has as a goal the formalization of the… (More)
Is this relevant?
2012
2012
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Core Locally Nameless Locally Namedde Bruijn Nominal Isomorphism TypedLang UntypedLang System F Simply typed lambda-calculus Etc . Untyped lambda-calculus DGP Layer Representation Layer Templates…
This paper presents GMETA: a generic framework for first-order representations of variable binding that provides once and for all… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2010
2010
A Solution to the PoplMark Challenge in Isabelle / HOL
  • Stefan Berghofer July
  • 2010
We present a solution to the PoplMark challenge designed by Aydemir et al., which has as a goal the formalization of the… (More)
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2008
2008
Bidirectional polymorphism through greed and unions
  • Joshua Dunfield McGill
  • 2008
Bidirectional typechecking has become a popular technique for advanced type systems. In this paper, I show how to extend past… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
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… (More)
Is this relevant?
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… (More)
Is this relevant?