Log In Sign Up

The Vectorial Lambda Calculus Revisited

by   Francisco Noriega, et al.

We revisit the Vectorial Lambda Calculus, a typed version of Lineal. Vectorial (as well as Lineal) was originally meant for quantum computing, as an extension to System F where linear combinations of lambda terms are also terms and linear combinations of types are also types. In its first presentation, Vectorial only provides a weakened version of the Subject Reduction property. We prove that our revised Vectorial Lambda Calculus supports the standard version of said property. In addition we also introduce the concept of weight of types and terms, and prove a relation between the weight of terms and of its types.


page 1

page 2

page 3

page 4


Semimodules and the (syntactically-)linear lambda calculus

In a recent paper, the ℒ^𝒮-calculus has been defined. It is a proof-lang...

Functional Pearl: The Distributive λ-Calculus

We introduce a simple extension of the λ-calculus with pairs—called the ...

π with leftovers: a mechanisation in Agda

The π-calculus is a computational model for communication and concurrenc...

Completeness of the ZX-Calculus

The ZX-Calculus is a graphical language for diagrammatic reasoning in qu...

The Theory of Call-by-Value Solvability (long version)

The denotational semantics of the untyped lambda-calculus is a well deve...

On principal types and well-foundedness of terms in ECC

When we investigate a type system, it is helpful if we can establish the...

Tracing sharing in an imperative pure calculus (Extended Version)

We introduce a type and effect system, for an imperative object calculus...