2003 | ||
---|---|---|
7 | EE | Tjark Weber, James L. Caldwell: Constructively Characterizing Fold and Unfold. LOPSTR 2003: 110-127 |
2001 | ||
6 | EE | James L. Caldwell: Extracting General Recursive Program Schemes in Nuprl's Type Theory. LOPSTR 2001: 233-244 |
2000 | ||
5 | EE | Jeffrey Van Baalen, James L. Caldwell, Shivakant Mishra: Specifying and Checking Fault-Tolerant Agent-Based Protocols Using Maude. FAABS 2000: 180-193 |
4 | EE | James L. Caldwell, Ian P. Gent, Judith L. Underwood: Search algorithms in type theory. Theor. Comput. Sci. 232(1-2): 55-90 (2000) |
1998 | ||
3 | James L. Caldwell: Classical Propositional Decidability via Nuprl Proof Extraction. TPHOLs 1998: 105-122 | |
2 | James L. Caldwell: Formal Methods Technology Transfer: A View from NASA. Formal Methods in System Design 12(2): 125-137 (1998) | |
1997 | ||
1 | EE | James L. Caldwell: Moving Proofs-As-Programs into Practice. ASE 1997: 10-17 |
1 | Jeffrey Van Baalen | [5] |
2 | Ian P. Gent | [4] |
3 | Shivakant Mishra | [5] |
4 | Judith L. Underwood | [4] |
5 | Tjark Weber | [7] |