Catarina Coquand A Formalised Proof of the Soundness and Completeness of a Simply Typed Lambda-Calculus with Explicit Substitutions. [Citation Graph (0, 0)][DBLP] Higher-Order and Symbolic Computation, 2002, v:15, n:1, pp:57-90 [Journal]
Hongwei Xi Dependent Types for Program Termination Verification. [Citation Graph (0, 0)][DBLP] Higher-Order and Symbolic Computation, 2002, v:15, n:1, pp:91-131 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP