A Linear Proof Language for Second-Order Intuitionistic Linear Logic
摘要
We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.