There is a newer version of the record available.

Published August 17, 2022 | Version v1
Software Open

A Calculus with Recursive Types, Record Concatenation and Subtyping (Artifact)

  • 1. The University of Hong Kong
  • 2. Zhejiang University

Description

This is the artifact of the APLAS 2022 research paper: A Calculus with Recursive Types, Record Concatenation and Subtyping.

We claimed in the paper that we formalized the \(\lambda_i^{\mu}\) calculus, together with its type-soundness proof in the Coq proof assistant. This artifact contains the corresponding Coq proof scripts. All definitions presented in the paper and lemmas, theorems with their proofs can be found. We show the correspondence between the paper and the proofs in the correspondence list.

Files

artifact-lambda-i-mu.zip

Files (1.0 GB)

Name Size Download all
md5:20e744ecf6cb7e955a983c66168193ca
1.0 GB Preview Download