We study the π-calculus, enriched with pairing, and define a notion of type assignment that uses the type constructor →. We encode the terms of the calculus X into this variant of π, and show that all reduction and assignable types are preserved. Since X enjoys the CurryHoward isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK have a… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.