polymorphic lambda calculus

E1600713 UNEXPLORED

Polymorphic lambda calculus is a typed formal system that extends the lambda calculus with universal quantification over types, forming a foundational framework for studying parametric polymorphism in programming languages and type theory.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (2)

Label	Occurrences
polymorphic lambda calculus canonical	2
Girard–Reynolds polymorphic lambda calculus	1

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

System F → hasAlternativeName → polymorphic lambda calculus ⓘ

subject linked to: system F

System F → alsoKnownAs → polymorphic lambda calculus ⓘ

System F → alsoKnownAs → Girard–Reynolds polymorphic lambda calculus ⓘ

linked to: polymorphic lambda calculus