Search the dblp DataBase
Zhaohui Luo :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Zhaohui Luo Coercive Subtyping in Type Theory. [Citation Graph (0, 0)][DBLP ] CSL, 1996, pp:276-296 [Conf ] Simon Shiu , Zhaohui Luo , Roberto Garigliano Type Theoretic Semantics for SemNet. [Citation Graph (0, 0)][DBLP ] FAPR, 1996, pp:582-595 [Conf ] Shenwei Yu , Zhaohui Luo Implementing a Model Checker for LEGO. [Citation Graph (0, 0)][DBLP ] FME, 1997, pp:442-458 [Conf ] Zhaohui Luo , Paul Callaghan Mathematical Vernacular and Conceptual Well-Formedness in Mathematical Language. [Citation Graph (0, 0)][DBLP ] LACL, 1997, pp:231-250 [Conf ] Zhaohui Luo A Unifying Theory of Dependent Types: The Schematic Approach. [Citation Graph (0, 0)][DBLP ] LFCS, 1992, pp:293-304 [Conf ] Zhaohui Luo ECC, an Extended Calculus of Constructions [Citation Graph (0, 0)][DBLP ] LICS, 1989, pp:386-395 [Conf ] Yong Luo , Zhaohui Luo Coherence and Transitivity in Coercive Subtyping. [Citation Graph (0, 0)][DBLP ] LPAR, 2001, pp:249-265 [Conf ] Zhaohui Luo Program Specification and Data Refinement in Type Theory. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1991, pp:143-168 [Conf ] Alex P. Jones , Zhaohui Luo , Sergei Soloviev Some Algorithmic and Proof-Theoretical Aspects of Coercive Subtyping. [Citation Graph (0, 0)][DBLP ] TYPES, 1996, pp:173-195 [Conf ] Robert Kießling , Zhaohui Luo Coercions in Hindley-Milner Systems. [Citation Graph (0, 0)][DBLP ] TYPES, 2003, pp:259-275 [Conf ] Paul Callaghan , Zhaohui Luo Implementation Techniques for Inductive Types in Plastic. [Citation Graph (0, 0)][DBLP ] TYPES, 1999, pp:94-113 [Conf ] Yong Luo , Zhaohui Luo Combining Incoherent Coercions for Sigma-Types. [Citation Graph (0, 0)][DBLP ] TYPES, 2003, pp:276-292 [Conf ] Yong Luo , Zhaohui Luo , Sergei Soloviev Weak Transitivity in Coercive Subtyping. [Citation Graph (0, 0)][DBLP ] TYPES, 2002, pp:220-239 [Conf ] Zhaohui Luo Coercion completion and conservativity in coercive subtyping. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:297-322 [Journal ] Zhaohui Luo A Higher-Order Calculus and Theory Abstraction [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1991, v:90, n:1, pp:107-137 [Journal ] Zhaohui Luo , Yong Luo Transitivity in coercive subtyping. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2005, v:197, n:1-2, pp:122-144 [Journal ] Paul Callaghan , Zhaohui Luo An Implementation of LF with Coercive Subtyping & Universes. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2001, v:27, n:1, pp:3-27 [Journal ] Jian-Min Pang , Paul Callaghan , Zhaohui Luo LFTOP : An LF -Based Approach to Domain-Specific Reasoning. [Citation Graph (0, 0)][DBLP ] J. Comput. Sci. Technol., 2005, v:20, n:4, pp:526-535 [Journal ] Zhaohui Luo PAL + : a lambda-free logical framework. [Citation Graph (0, 0)][DBLP ] J. Funct. Program., 2003, v:13, n:2, pp:317-338 [Journal ] Zhaohui Luo Coercive Subtyping. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 1999, v:9, n:1, pp:105-130 [Journal ] Zhaohui Luo Program Specification and Data Refinement in Type Theory. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 1993, v:3, n:3, pp:333-363 [Journal ] Zhaohui Luo , Sergei Soloviev Dependent Coercions. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:29, n:, pp:- [Journal ] Zeng Bin , Luo Zhaohui , Wei Jun Grid Scheduling Optimization Under Conditions of Uncertainty. [Citation Graph (0, 0)][DBLP ] NPC, 2007, pp:51-60 [Conf ] Robin Adams , Zhaohui Luo Weyl's Predicative Classical Mathematics as a Logic-Enriched Type Theory. [Citation Graph (0, 0)][DBLP ] TYPES, 2006, pp:1-17 [Conf ] A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations. [Citation Graph (, )][DBLP ] Manifest Fields and Module Mechanisms in Intensional Type Theory. [Citation Graph (, )][DBLP ] Weyl's Predicative Classical Mathematics as a Logic-Enriched Type Theory [Citation Graph (, )][DBLP ] Classical Predicative Logic-Enriched Type Theories [Citation Graph (, )][DBLP ] Search in 0.020secs, Finished in 0.022secs