Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,206,720 papers from all fields of science
Search
Sign In
Create Free Account
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<…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
9 relations
Bounded quantifier
POPLmark challenge
Parametric polymorphism
Programming language theory
Expand
Broader (3)
Functional programming
Lambda calculus
Type 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
Nada Amin
,
Tiark Rompf
POPL
2017
Corpus ID: 3219109
While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to…
Expand
2016
2016
Dependent Object Types
Nada Amin
2016
Corpus ID: 118697862
We propose a new type-theoretic foundation of Scala and languages like it: the Dependent Object Types (DOT) calculus. DOT models…
Expand
2015
2015
From F to DOT: Type Soundness Proofs with Definitional Interpreters
Tiark Rompf
,
Nada Amin
ArXiv
2015
Corpus ID: 6182675
Scala's type system unifies ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT) family of…
Expand
2015
2015
Mechanizing type environments in weak HOAS
Alberto Ciaffaglione
,
Ivan Scagnetto
Theor. Comput. Sci.
2015
Corpus ID: 38930807
2012
2012
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
Gyesik Lee
,
B. C. Oliveira
,
Sungkeun Cho
,
K. Yi
ESOP
2012
Corpus ID: 8794310
This paper presents GMeta: a generic framework for first-order representations of variable binding that provides once and for all…
Expand
2009
2009
Bidirectional polymorphism through greed and unions
Jana Dunfield
2009
Corpus ID: 11811783
Bidirectional typechecking has become popular in advanced type systems because it works in many situations where inference is…
Expand
2006
2006
A Comparison between Concrete Representations for Bindings Extended
A. Charguéraud
2006
Corpus ID: 185398
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
Brian E. Aydemir
,
A. Bohannon
,
+7 authors
S. Zdancewic
TPHOLs
2005
Corpus ID: 3145029
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