| 2012 | ||
|---|---|---|
| i1 | Zhiqiang Ren, Hongwei Xi: A Programmer-Centric Approach to Program Verification in ATS. CoRR abs/1203.6102 (2012) | |
| 2010 | ||
| c32 | Rui Shi, Dengping Zhu, Hongwei Xi: A Modality for Safe Resource Sharing and Code Reentrancy. ICTAC 2010: 382-396 | |
| c31 | Matthew Danish, Hongwei Xi: Operating system development with ATS: work in progress. PLPV 2010: 9-14 | |
| 2009 | ||
| j13 | Matthew Danish, Hongwei Xi: Operating system development with ATS: work in progress: (abstract only). SIGPLAN Notices 44(11): 6 (2009) | |
| c30 | ||
| 2007 | ||
| j12 | Kevin Donnelly, Hongwei Xi: A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F. Electr. Notes Theor. Comput. Sci. 174(5): 109-125 (2007) | |
| j11 | ||
| j10 | Hongwei Xi: Dependent ML An approach to practical programming with dependent types. J. Funct. Program. 17(2): 215-286 (2007) | |
| c29 | ||
| e1 | Aaron Stump, Hongwei Xi (Eds.): Proceedings of the ACM Workshop Programming Languages meets Program Verification, PLPV 2007, Freiburg, Germany, October 5, 2007. ACM 2007, isbn 978-1-59593-677-6 | |
| 2006 | ||
| j9 | Hongwei Xi: Development Separation in Lambda-Calculus. Electr. Notes Theor. Comput. Sci. 143: 207-221 (2006) | |
| j8 | Chiyan Chen, Rui Shi, Hongwei Xi: Implementing Typeful Program Transformations. Fundam. Inform. 69(1-2): 103-121 (2006) | |
| c28 | ||
| 2005 | ||
| j7 | Chiyan Chen, Hongwei Xi: Meta-programming through typeful code representation. J. Funct. Program. 15(5): 797-835 (2005) | |
| c27 | Sa Cui, Kevin Donnelly, Hongwei Xi: ATS: A Language That Combines Programming with Theorem Proving. FroCoS 2005: 310-320 | |
| c26 | Kevin Donnelly, Hongwei Xi: Combining higher-order abstract syntax with first-order abstract syntax in ATS. MERLIN 2005: 58-63 | |
| c25 | ||
| c24 | ||
| 2004 | ||
| j6 | Peter B. Andrews, Chad E. Brown, Frank Pfenning, Matthew Bishop, Sunil Issar, Hongwei Xi: ETPS: A System to Help Students Write Formal Proofs. J. Autom. Reasoning 32(1): 75-92 (2004) | |
| c23 | Chiyan Chen, Rui Shi, Hongwei Xi: A Typeful Approach to Object-Oriented Programming with Multiple Inheritance. PADL 2004: 23-38 | |
| c22 | Chiyan Chen, Dengping Zhu, Hongwei Xi: Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell. PADL 2004: 239-254 | |
| 2003 | ||
| j5 | Chiyan Chen, Hongwei Xi: Meta-programming through typeful code representation. SIGPLAN Notices 38(9): 275-286 (2003) | |
| c21 | Dengping Zhu, Hongwei Xi: A Typeful and Tagless Representation for XML Documents. APLAS 2003: 89-104 | |
| c20 | Walid Taha, Stephan Ellner, Hongwei Xi: Generating Heap-Bounded Programs in a Functional Setting. EMSOFT 2003: 340-355 | |
| c19 | ||
| c18 | ||
| c17 | ||
| c16 | ||
| c15 | ||
| 2002 | ||
| j4 | Hongwei Xi: Dependent Types for Program Termination Verification. Higher-Order and Symbolic Computation 15(1): 91-131 (2002) | |
| c14 | Hongwei Xi: Unifying object-oriented programming with typed functional programming. ASIA-PEPM 2002: 117-125 | |
| 2001 | ||
| c13 | ||
| c12 | ||
| 2000 | ||
| c11 | ||
| 1999 | ||
| j3 | Femke van Raamsdonk, Paula Severi, Morten Heine Sørensen, Hongwei Xi: Perpetual Reductions in Lambda-Calculus. Inf. Comput. 149(2): 173-225 (1999) | |
| j2 | Hongwei Xi: Upper Bounds for Standardizations and An Application. J. Symb. Log. 64(1): 291-303 (1999) | |
| c10 | Hongwei Xi, Songtao Xia: Towards array bound check elimination in Java TM virtual machine language. CASCON 1999: 14 | |
| c9 | ||
| c8 | ||
| 1998 | ||
| c7 | Hongwei Xi, Frank Pfenning: Eliminating Array Bound Checking Through Dependent Types. PLDI 1998: 249-257 | |
| c6 | ||
| 1997 | ||
| c5 | Hongwei Xi: Upper Bounds for Standardizations and an Application. Kurt Gödel Colloquium 1997: 335-348 | |
| c4 | Hongwei Xi: Simulating eta-expansions with beta-reductions in the Second-Order Polymorphic lambda-calculus. LFCS 1997: 399-409 | |
| c3 | ||
| c2 | ||
| 1996 | ||
| j1 | Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi: TPS: A Theorem-Proving System for Classical Type Theory. J. Autom. Reasoning 16(3): 321-353 (1996) | |
| 1993 | ||
| c1 | Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi: TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory. HUG 1993: 366-370 | |
Colors in the list of coauthors
Last update Sat May 25 09:02:07 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page