James Lipton Kripke Semantics for Dependent Type Theory and Realizability Interpretations. [Citation Graph (0, 0)][DBLP] Constructivity in Computer Science, 1991, pp:22-32 [Conf]
Scott F. Smith Reflective Semantics of Constructive Type Theory: Preliminary Report. [Citation Graph (0, 0)][DBLP] Constructivity in Computer Science, 1991, pp:33-45 [Conf]
Simon Thompson Are Subsets Necessary in Martin-Löf Type Theory? [Citation Graph (0, 0)][DBLP] Constructivity in Computer Science, 1991, pp:46-57 [Conf]
Jianguo Lu, Jiafu Xu Development Transformation Based on Higher Order Type Theory. [Citation Graph (0, 0)][DBLP] Constructivity in Computer Science, 1991, pp:58-70 [Conf]
Chetan R. Murthy Classical Proofs as Programs: How, What, and Why. [Citation Graph (0, 0)][DBLP] Constructivity in Computer Science, 1991, pp:71-88 [Conf]
Klaus Weihrauch A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity. [Citation Graph (0, 0)][DBLP] Constructivity in Computer Science, 1991, pp:228-246 [Conf]
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
