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

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A Bloom Filter is a space-efficient randomized data structure allowing membership queries over sets with certain allowable errors… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We study length-minimizing arcs in sub-Riemannian manifolds (M;E;G) whose metric G is de ned on a rank-two bracket-generating… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The design of a module system for constructing and maintaining large programs is a difficult task that raises a number of… Expand
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper defines a set of type inference rules for resolving over-loading introduced by type classes. Programs including type… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
From the Publisher: This book, the first on the subject in English, gives a readable but rigorous introduction to the theory of… Expand
  • figure 2.1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Publisher Summary This chapter describes the development of a semantics of computation free from the twin drawbacks of… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
From the type of a polymorphic function we can derive a theorem that it satisfies. Every function of the same type satisfies the… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We constructed a theory of the universal types of values as criteria by viewing values as cognitive representations of three… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
  • J. Girard
  • Theor. Comput. Sci.
  • 1986
  • Corpus ID: 26878325
The semantic study of system F stumbles on the problem of variable types for which there was no convincing interpretation; we… Expand
Is this relevant?