Work

Bounded quantification is undecidable

Year: 1992
Type: conference-paper
Abstract: F≤ is a typed λ-calculus with subtyping and bounded second-order polymorphism. First proposed by Cardelli and Wegner, it has been widely studied as a core calculus for type systems with subtyping.
Language: English
Subfield: Software
Open Access status: bronze
OpenAlex ID: W2121169478
FWCI: 6.254
Cites: 26
Cited by: 71
Related to: 10