Caldwell, James - Department of Computer Science, University of Wyoming

• A machine checked model of MGU axioms: applications of finite maps and functional induction
• Graduate Examination Spring 2011
• Proof extraction from multi-succedent intuitionistic derivations
• Search Algorithms in Type Theory James L. Caldwell
• Teaching Natural Deduction as a Subversive James Caldwell
• Constructive membership predicates as index James Caldwell
• Hierarchical Approach to Specification and Verification
• Submitted to: A Machine Checked Model of Idempotent MGU Axioms For
• On Extending Wand's Type Reconstruction Algorithm to Handle Polymorphic Let
• Formal Methods Technology Transfer: A View from NASA
• Curriculum Vitae James L. Caldwell
• Analysis of Algorithms Qualifying Exam Spring 2005
• Logic and Discrete Mathematics Computer Scientists
• Extracting Recursion Operators in Nuprl's Type James L. Caldwell
• Logical Aspects of Digital Mathematics Libraries (extended abstract)
• Extending Dynamic Constraint Detection with Disjunctive Constraints
• WORKSHOP ON RECENT TRENDS IN PROOF THEORY University of Bern, July 9 11, 2008
• Area: Computer Theory Three questions each from three parts
• Automated Reasoning Ph.D. Qualifier Exam September 22, 2005
• Quicksort via Bird's Tree Fusion Transformation Tjark Weber1
• The Language PCF 2.1 Introduction
• Introduction 1.1 Model Programming Languages
• Extracting Propositional Decidability: A proof of propositional decidability in constructive
• Specifying and Checking Fault-tolerant Agent-based Protocols using Maude
• 1 EAs and SAT In the Boolean Satisfiability Problem (SAT), one has a Boolean expression
• Toward a machine-certified correctness proof of Wand's type reconstruction algorithm
• DECIDABILITY EXTRACTED: SYNTHESIZING "CORRECT-BY-CONSTRUCTION"
• Moving Proofs-As-Programs Into Practice James L. Caldwell
• A Framework for Interactive Sharing and Deductive Searching in Distributed
• Checking Nuprl Proofs in ACL2: A Progress Report
• Enumerating Without Repetition
• John Paul et al.: Toward a Formal Evaluation of Refactorings, Proceedings of The Sixth NASA Langley Formal Methods Workshop, p.3335
• Graduate Examination Spring 2009
• Specification Graduate Examination
• Graduate Handbook Department of Computer Science
• UW REGULATION 6-802 Procedures and Authorized University Actions in Cases of Student Academic
• 2005 Qualifying Exam Department of Computer Science
• Software Engineering Ph.D. Qualifier Exam September 22, 2005
• Ph.D. Qualifying Examination Principles of Programming Languages
• NASA Langley's Research and TechnologyTransfer Program in Formal Methods
• Generalized Support and Formal Development of Constraint Propagators
• THE UNIVERSITY OF WYOMING Laramie, Wyoming
• Teaching Natural Deduction as a Subversive Activity