System F

Known as: Higher-order polymorphic lambda calculus, Second order lambda calculus, System Fω 
System F, also known as the (Girard–Reynolds) polymorphic lambda calculus or the second-order lambda calculus, is a typed lambda calculus that… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
020406019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
We present a new, completely redesigned, version of F*, a language that works both as a proof assistant as well as a general… (More)
Is this relevant?
2014
2014
We present a second-order λ-calculus with coercion constraints that generalizes a previous extension of System F with parametric… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We introduce System FC, which extends System F with support for non-syntactic type equality. There are two main extensions: (i… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2002
2002
By identifying antibiotics that eliminated Agrobacterium tumefaciens with the least phytotoxic effects, we were able to select… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
 
Is this relevant?
Highly Cited
1991
Highly Cited
1991
 
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In recent years various calculi, logics, and type systems have emerged that capture notions of sideeffects, sequencing, and… (More)
  • figure 1
Is this relevant?
Highly Cited
1987
Highly Cited
1986
Highly Cited
1986
The semantic study of system F stumbles on the problem of variable types for which there was no convincing interpretation; we… (More)
Is this relevant?