arXiv - CS - Logic in Computer Science Pub Date : 2019-11-28 , DOI: arxiv-1911.12749
Ferruccio Guidi

We present the framework $\lambda\delta$-2B that significantly improves and generalizes two previous formal systems of the $\lambda\delta$ family, i.e., $\lambda\delta$-1A and $\lambda\delta$-2A. Our main contributions are, on the one hand, a short definition for the framework and, on the other hand, some important results that we are presenting here for the first time. The definition stands just on two notions, i.e., bound rt-reduction and parametric validity. Our new results are the confluence of bound rt-reduction on valid terms, the decidability of validity, of type inference and type checking and an axiomatization of the type judgment for the system $\lambda\delta$-2A. As a key feature, the framework and its theory have been developed and checked with the valuable help of the interactive prover Matita.

down
wechat
bug