Greedy Implicit Bounded Quantification (Artifact)

This contains the artifact for the paper Greedy Implicit Bounded Quantification. In main.zip,

• extended-paper.pdf is the extended version of the paper (with Appendix);
• README.md is the detailed documentation of the artifact;
• proofs contains all Abella proof scripts that can be executed in the latest unmodified version of Abella (version 2.0.8-dev (commit 2a14f32)). These scripts should be sufficient to verify our proofs;
• variant-proofs contains all Abella proof scripts of the variant calculus mentioned in section 5.1. It can also be executed in the latest official version of Abella (version 2.0.8-dev (commit `2a14f32`));
• implementation contains a simple Haskell implementation of our type inference algorithm that can run the examples in Section 2.3. The implementation will print the algorithmic derivation rules employed during the inference process.

We also provide standalone Docker image files for implementation, proof, and variant-proof in separate .tar.gz files。