Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization  by O'Leary, John, Miriam Leeser, Jason Hickey, and Mark Aagaard, Theorem Provers in Circuit Design, Theory Practice and Experience (TPCD '94), Springer-Verlag, 1994.

           Verifying a Logic Synthesis Tool in Nuprl: A Case Study in Software Verification  by Aagaard, Mark, and Miriam Leeser, Proceedings of Computer Aided Verification: Proceedings of the Fourth International Workshop (CAV'92), G. von Bochmann and D. Probst (eds.), pp. 69-81, Springer-Verlag, 1993.

           The Semantics of Reflected Proof  by Allen, Stuart F., Robert L. Constable, Douglas J. Howe, and William Aitken, Proceedings of Fifth IEEE Symposium on Logic in Computer Science, pp. 95-197, 1990.

            An Abstract Semantics for Atoms in Nuprl  by Allen, Stuart F., Cornell Tech Report TR2006-2032, 2006.

           Abstract Identifiers and Textual Reference  by Allen, Stuart F., Cornell University Technical Report 2002-1885, 2002.

           Abstract Identifiers, Intertextual Reference and a Computational Basis for Recordkeeping  by Allen, Stuart F., First Monday, vol. 9, no. 2, 2004.

           Enabling Large Scale Coherency Among Mathematical Texts  by Allen, Stuart F., and Robert L. Constable, Cornell University Technical Report, 2006-2014, 2006.

           Expressing and Implementing the Computational Content Implicit in Smullyan's Account of Boolean Valuations  by Allen, Stuart F., Robert L. Constable, and Matthew Fluet, Cornell University Technical Report 2004-1933, 2004.

           FDL: A Prototype Formal Digital Library  by Allen, Stuart F., Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, and Lori Lorigo, Cornell University Technical Report 2004-1941, 2002.

           From dy/dx to []P: A Matter of Notation  by Allen, Stuart F., Proceedings of Conference on User Interfaces for Theorem Provers, 1998.

           Implementing Mathematics with the Nuprl Development System  by Constable, Robert L., Stuart F. Allen, H. M. Bromley, Walter Rance Cleaveland, J. F. Cremer, Robert W. Harper, Douglas J. Howe, Todd B. Knoblock, Nax P. Mendler, Prakash Panangaden, James T. Sasaki, and Scott F. Smith, Prentice-Hall:NJ, 1986.

           Innovations in Computational Type Theory using Nuprl  by Allen, Stuart F., Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo, and Evan Moran, Journal of Applied Logic, Volume 4, Issue 4, December 2006, Pages 428-469, 2006.

       Logical Aspects of Digital Mathematics Libraries (extended abstract)  by Allen, Stuart F., James L. Caldwell, and Robert L. Constable, Proceedings of First International Workshop on Mathematical Knowledge Management (MKM'01), RISC, A-4232 Schloss Hagenberg, Austria, 2001.

       A Non-Type-Theoretic Definition of Martin-Lof's Types  by Allen, Stuart F., Proceedings of Second IEEE Symposium on Logic in Computer Science, pp. 215-224, (also Cornell TR 87-832), 1987.

       A Non-Type-Theoretic Semantics for Type-Theoretic Language  by Allen, Stuart F., Cornell University Ph.D. Thesis, 1987.

       The Nuprl Open Logical Environment  by Allen, Stuart F., Robert L. Constable, Richard Eaton, Christoph Kreitz, and Lori Lorigo, Proceedings of 17th International Conference on Automated Deduction, LNAI 1831, pp. 170-176, Springer-Verlag, 2000.

       Practical Reflection in Nuprl  by Barzilay, Eli, Stuart F. Allen, and Robert L. Constable, Proceedings of 18th IEEE Symposium on Logic in Computer Science, P. Kolaitis (ed.), 2003.

       Reflecting Higher-Order Abstract Syntax in Nuprl  by Barzilay, Eli, and Stuart F. Allen, Track B Proceedings of 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs '02), pp. 23-32, 2002.

       Reflecting the Open-Ended Computation System of Constructive Type Theory  by Constable, Robert L., Stuart F. Allen, and Douglas J. Howe, Logic Algebra and Computation (NATO ASI Series), H. Schwichtenberg (ed.), vol. F79, 1990.

       The Semantics of Reflected Proof  by Allen, Stuart F., Robert L. Constable, Douglas J. Howe, and William Aitken, Proceedings of Fifth IEEE Symposium on Logic in Computer Science, pp. 95-197, 1990.

       Using Formal Reference to Enhance Authority and Integrity in Online Mathematical Texts  by Allen, Stuart F., Robert L. Constable, and Lori Lorigo, To appear in Journal of Electronic Publishing, February, 2006.

           MetaPRL -- A Modular Logical Environment  by Hickey, Jason, Aleksey Nogin, Robert L. Constable, Brian Aydemir, Eli Barzilay, and Lori Lorigo, Proceedings of 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'03), D. Basin and B. Wolff (eds.), LNCS 2758, pp. 287-303, Springer-Verlag, 2003.

            Implementing Reflection in Nuprl  by Barzilay, Eli, Cornell University Ph.D. Thesis, 2006.

           MetaPRL -- A Modular Logical Environment  by Hickey, Jason, Aleksey Nogin, Robert L. Constable, Brian Aydemir, Eli Barzilay, and Lori Lorigo, Proceedings of 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'03), D. Basin and B. Wolff (eds.), LNCS 2758, pp. 287-303, Springer-Verlag, 2003.

           Practical Reflection in Nuprl  by Barzilay, Eli, Stuart F. Allen, and Robert L. Constable, Proceedings of 18th IEEE Symposium on Logic in Computer Science, P. Kolaitis (ed.), 2003.

           Quotation and Reflection in Nuprl and Scheme  by Barzilay, Eli, Cornell University Technical Report 2001-1832, 2001.

           Reflecting Higher-Order Abstract Syntax in Nuprl  by Barzilay, Eli, and Stuart F. Allen, Track B Proceedings of 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs '02), pp. 23-32, 2002.

           Verbalization of High-Level Formal Proofs  by Holland-Minkley, Amanda, Regina Barzilay, and Robert L. Constable, Proceedings of Sixteenth National Conference on Artificial Intelligence, pp. 277-284, 1999.

           Building Problem Solving Environments in Constructive Type Theory  by Basin, David A., Cornell University Ph.D. Thesis, 1990.

           Building Theories in Nuprl  by Basin, David A., Proceedings of Logic at Botik '89, LNCS 363, pp. 12-25, Springer-Verlag:Pereslavl-Zalessky, USSR, (also Cornell Technical Report 88-932), 1989.

           An Environment for Automated Reasoning About Partial Functions  by Basin, David A., Proceedings of Ninth International Conference on Automated Deduction, LNCS 310, pp. 101-110, Springer-Verlag:NY, (also Cornell TR 87-884), 1988.

           Extracting Circuits from Constructive Proofs  by Basin, David A., Department of Artificial Intelligence, Edinburgh, Research Paper 533, (also appeared in Proceedings of the IFIP-IEEE International Workshop on Formal Methods in VLSI Design), 1991.

           Formally Verified Synthesis of Combinational Circuits  by Basin, David A., Geoffrey Brown, and Miriam Leeser, Integration: The International Journal of VLSI Design, vol. 11, pp. 235-250, 1991.

           Metalogical Frameworks  by Basin, David A., and Robert L. Constable, Proceedings of Second Annual Workshop on Logical Frameworks, (also Cornell Technical Report 91-1235), 1991.

           Some Normalization Properties of Martin-Lof's Type Theory and Applications  by Basin, David A., and Douglas J. Howe, International Conference on Theoretical Aspects of Computer Software (TACS '91), LNCS 526, pp. 475-494, Springer-Verlag, 1991.

           Verification of Combinational Logic in Nuprl  by Basin, David A., and Peter Del Vecchio, Hardware Specification Verification and Synthesis: Mathematical Aspects, LNCS 408, pp. 333-357, Springer-Verlag, (also Cornell TR 89-1018), 1989.

           A Logic for Correct Program Development  by Bates, Joseph L., Revision of Cornell University Ph.D. Thesis submitted August 1979, 1981.

           Proofs as Programs  by Bates, Joseph L., and Robert L. Constable, ACM Transactions on Programming Languages and Systems, vol. 7, no. 1, pp. 53-71, (also Cornell University Technical Report 82-530), 1985.

           Writing Programs That Construct Proofs  by Constable, Robert L., Todd B. Knoblock, and Joseph L. Bates, Journal of Automated Reasoning, vol. 1, no. 3, pp. 285-326, 1984.

           Automated Complexity Analysis of Nuprl Extracted Programs  by Benzinger, Ralph, Journal of Functional Programming, vol. 11, no.1, pp. 3-31, 2001.

           Automated Computational Complexity Analysis  by Benzinger, Ralph, Cornell University Ph.D. Thesis, 2001.

           A Causal Logic of Events in Formalized Computational Type Theory  by Bickford, Mark, and Robert L. Constable, Cornell University Technical Report, 2005.

           An Experiment in Formal Design Using Meta-Properties  by Bickford, Mark, Christoph Kreitz, Robbert van Renesse, and Robert L. Constable, Proceedings of DARPA Information Survivability Conference and Exposition II (DISCEX II), pp. 100-107, 2001.

           FDL: A Prototype Formal Digital Library  by Allen, Stuart F., Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, and Lori Lorigo, Cornell University Technical Report 2004-1941, 2002.

           Formalizing chain replication  by Guaspari, David, and Mark Bickford, , 2006.

           Formally Verifying Hybrid Protocols with the Nuprl Logical Programming Environment  by Bickford, Mark, Christoph Kreitz, and Robbert van Renesse, Cornell University Technical Report 2001-1839, 2001.

           Innovations in Computational Type Theory using Nuprl  by Allen, Stuart F., Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo, and Evan Moran, Journal of Applied Logic, Volume 4, Issue 4, December 2006, Pages 428-469, 2006.

           Knowledge-Based Synthesis of Distributed Systems Using Event Structures  by Bickford, Mark, Robert L. Constable, Joseph Y. Halpern, and Sabina Petride, Cornell University Technical Report 2004-1927, 2004.

           Knowledge-based synthesis of distributed systems using event structures.  by Bickford, Mark, Robert L. Constable, Joseph Y. Halpern, and Sabina Petride, In Franz Baader and Andreo Voronsky, editors, Logic for Programming, Artificial Intelligence, and Reasoning, volume 3452 of Lecture Notes in Computer Science, pages 449-465, 2005.

           A Logic of Events  by Bickford, Mark, and Robert L. Constable, Cornell University Technical Report 2003-1893, 2003.

       A Nuprl-PVS Connection: Integrating Libraries of Formal Mathematics  by Kleinberg, Jon, Mark Bickford, Robert L. Constable, Richard Eaton, and Christoph Kreitz, Cornell University Technical Report 2003-1889, 2003.

       An Object-Oriented Approach to Verifying Group Communication Systems  by Bickford, Mark, and Jason Hickey, Proceedings of CADE-16, 1999.

       A Programming Logic for Distributed Systems  by Bickford, Mark, and David Guaspari, ATC-NY Technical Report, 2005.

       Protocol Switching: Exploiting Meta-Properties  by Liu, Xiaoming, Robbert van Renesse, Mark Bickford, Christoph Kreitz, and Robert L. Constable, ProceedingsInternational Workshop on Applied Reliable Group Communication (WARGC'01), IEEE Computer Society Press, 2001.

       Proving Hybrid Protocols Correct  by Bickford, Mark, Christoph Kreitz, Robbert van Renesse, and Xiaoming Liu, Proceedings of 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'01), R. Boulton and P. Jackson (eds.), LNCS 2152, pp. 105-120, Springer-Verlag, 2001.

       Unguessable Atoms: A Logical Foundation for Security  by Bickford, Mark, , 2006.

           Building Reliable, High-Performance Communication Systems from Components  by Liu, Xiaoming, Christoph Kreitz, Robbert van Renesse, Jason Hickey, Mark Hayden, Kenneth Birman, and Robert L. Constable, Proceedings of 17th ACM Symposium on Operating System Principles (SOSP'99), Operating Systems Review, vol. 34, no. 5, pp. 80-92, 1999.

           The Horus and Ensemble Projects: Accomplishments and Limitations  by Birman, Kenneth, Robert L. Constable, Mark Hayden, Jason Hickey, Christoph Kreitz, Robbert van Renesse, Ohad Rodeh, and Werner Vogels, Proceedings of DARPA Information Survivability Conference and Exhibition (DISCEX '00), 2000.

           Implementing Mathematics with the Nuprl Development System  by Constable, Robert L., Stuart F. Allen, H. M. Bromley, Walter Rance Cleaveland, J. F. Cremer, Robert W. Harper, Douglas J. Howe, Todd B. Knoblock, Nax P. Mendler, Prakash Panangaden, James T. Sasaki, and Scott F. Smith, Prentice-Hall:NJ, 1986.

           Formally Verified Synthesis of Combinational Circuits  by Basin, David A., Geoffrey Brown, and Miriam Leeser, Integration: The International Journal of VLSI Design, vol. 11, pp. 235-250, 1991.

           The Oyster-Clam System  by Bundy, Alan, Frank Van Harmelen, Christian Horn, and Alan Smaill, Proceedings of 10th International Conference on Automated Design, LNAI 449, M. E. Stickel (ed.), pp. 647-648, Springer-Verlag, 1990.

           Classical Propositional Decidability via Nuprl Proof Extraction  by Caldwell, James L., Proceedings of 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs '98), J. Grundy and M. Newey (eds.), LNCS 1479, pp. 105-122, Springer-Verlag, 1998.

           Classical Tools for Constructive Proof Search  by Caldwell, James L., and Judith Underwood, Proceedings of CADE-13 Workshop on Proof Search in Type-Theoretic Languages, D. Galmiche (ed.), Rutgers:NJ, 1996.

           Decidability Extracted: Synthesizing "Correct-by-Construction" Decision Procedures from Constructive Proofs  by Caldwell, James L., Cornell University Ph.D Thesis, 1998.

           Extracting Propositional Decidability: A Proof of Propositional Decidability in Constructive Type Theory and its Extracted Program  by Caldwell, James L., Unpublished manuscript, 1997.

           Intuitionistic Tableau Extracted  by Caldwell, James L., Proceedings of International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX '99), LNAI 1617, pp. 82-96, Springer-Verlag, 1999.

           Logical Aspects of Digital Mathematics Libraries (extended abstract)  by Allen, Stuart F., James L. Caldwell, and Robert L. Constable, Proceedings of First International Workshop on Mathematical Knowledge Management (MKM'01), RISC, A-4232 Schloss Hagenberg, Austria, 2001.

           Moving Proofs-as-Programs into Practice  by Caldwell, James L., Proceedings of 12th IEEE International Conference Automated Software Engineering (ASE'97), 1997.

           Search Algorithms in Type Theory  by Caldwell, James L., Ian Gent, and Judith Underwood, Theoretical Computer Science, vol. 232, nos. 1-2, pp. 55-90, 2000.

           Reversal-Bounded Computations  by Chan, Tat-hung, Cornell University Ph.D. Thesis, 1980.

           Tactic-Based Theorem Proving and Knowledge-Based Forward Chaining: An Experiment with Nuprl and Ontic  by Chen, Wilfred Z., Proceedings of 11th International Conference on Automated Deduction, D. Kapur (ed.), LNCS 607, pp. 552-566, Springer-Verlag, (also Cornell Technical Report 92-1276), 1992.

           Collaborative Mathematics Environments  by Constable, Robert L., Paul Chew, Keshav Pingali, Steve Vavasis, and Richard Zippel, Unpublished manuscript, Cornell University, 1996.

           Implementing Mathematics with the Nuprl Development System  by Constable, Robert L., Stuart F. Allen, H. M. Bromley, Walter Rance Cleaveland, J. F. Cremer, Robert W. Harper, Douglas J. Howe, Todd B. Knoblock, Nax P. Mendler, Prakash Panangaden, James T. Sasaki, and Scott F. Smith, Prentice-Hall:NJ, 1986.

           Type-Theoretic Models of Concurrency  by Cleaveland, Walter Rance, Cornell University Ph.D. Thesis, 1987.

           Assigning Meaning to Proofs: A Semantic Basis for Problem Solving Environments  by Constable, Robert L., Constructive Methods of Computing Science (NATO ASI Series), M. Broy (ed.), vol. F55, pp. 63-91, 1989.

           Building Reliable, High-Performance Communication Systems from Components  by Liu, Xiaoming, Christoph Kreitz, Robbert van Renesse, Jason Hickey, Mark Hayden, Kenneth Birman, and Robert L. Constable, Proceedings of 17th ACM Symposium on Operating System Principles (SOSP'99), Operating Systems Review, vol. 34, no. 5, pp. 80-92, 1999.

           A Causal Logic of Events in Formalized Computational Type Theory  by Bickford, Mark, and Robert L. Constable, Cornell University Technical Report, 2005.

           Collaborative Mathematics Environments  by Constable, Robert L., Paul Chew, Keshav Pingali, Steve Vavasis, and Richard Zippel, Unpublished manuscript, Cornell University, 1996.

           Computational Complexity and Induction for Partial Computable Functions in Type Theory  by Constable, Robert L., and Karl Crary, Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman, W. Sieg, R. Sommer, and C. Talcott (eds.), pp. 166-183, Association for Symbolic Logic, 2002.

           Computational Foundations of Basic Recursive Function Theory  by Constable, Robert L., and Scott F. Smith, Proceedings of Third IEEE Symposium on Logic in Computer Science, pp. 360-371, (also Cornell Technical Report 88-904), 1988.

           Constructive Mathematics and Automatic Program Writers  by Constable, Robert L., Proceedings of IFIP Congress, pp. 229-233, 1971.

           Constructive Mathematics as a Programming Logic I: Some Principles of Theory  by Constable, Robert L., Annals of Mathematics, vol. 24, Elsevier Science Publishers BV: North-Holland, (also Cornell Technical Report 83-554), 1985.

           Creating and Evaluating Interactive Formal Courseware for Mathematics and Computing  by Constable, Robert L., Unpublished manuscript, Cornell University, 1996.

       Enabling Large Scale Coherency Among Mathematical Texts  by Allen, Stuart F., and Robert L. Constable, Cornell University Technical Report, 2006-2014, 2006.

       Experience Using Type Theory as a Foundation for Computer Science Circa 1985-1995  by Constable, Robert L., Unpublished manuscript, Cornell University, 1996.

       An Experiment in Formal Design Using Meta-Properties  by Bickford, Mark, Christoph Kreitz, Robbert van Renesse, and Robert L. Constable, Proceedings of DARPA Information Survivability Conference and Exposition II (DISCEX II), pp. 100-107, 2001.

       Exporting and Reflecting Abstract Meta-mathematics  by Constable, Robert L., Proceedings of 12th International Conference on Automated Deduction, A. Bundy (ed.), LNAI 814, p 529, Springer-Verlag, 1994.

       Expressing and Implementing the Computational Content Implicit in Smullyan's Account of Boolean Valuations  by Allen, Stuart F., Robert L. Constable, and Matthew Fluet, Cornell University Technical Report 2004-1933, 2004.

       Expressing Computational Complexity in Constructive Type Theory  by Constable, Robert L., Proceedings of International Workshop on Logic and Computational Complexity (LCC'94), D. Leivant (ed.), LNCS 960, pp. 131-144, Springer-Verlag, 1995.

       Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics  by Constable, Robert L., and Wojciech Moczydlowski, , 2006.

       Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus  by Moczydlowski, Wojciech, and Robert L. Constable, Cornell University Technical Report 2006-2061. To appear in Proceedings of Symposium on Logical Foundations of Computer Science 2007, 2007.

       FDL: A Prototype Formal Digital Library  by Allen, Stuart F., Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, and Lori Lorigo, Cornell University Technical Report 2004-1941, 2002.

       Finding Computational Content from Classical Proofs  by Constable, Robert L., and Chetan Murthy, Logical Frameworks, G. Huet and G. Plotkin (eds.), pp. 341-362, Cambridge University Press, 1991.

       Formal Theories and Software Systems: Fundamental Connections Between Computer Science and Logic  by Constable, Robert L., Future Tendencies in Computer Science: Control and Applied Mathematics, A. Bensoussan and J.-P. Verjus (eds.), LNCS 653, pp. 105-127, Springer-Verlag, 1992.

       Formalized Metareasoning in Type Theory  by Knoblock, Todd B., and Robert L. Constable, Proceedings of First IEEE Symposium on Logic in Computer Science, pp. 237-248, 1986.

       Formalizing Automata II: Decidable Properties  by Constable, Robert L., and Pavel Naumov, Unpublished manuscript, Cornell University, 1996.

       Formalizing Automata Theory I: Finite Automata  by Constable, Robert L., Paul B. Jackson, Pavel Naumov, and Juan Uribe, Unpublished manuscript, Cornell University, 1996.

       A Graph-Based Approach towards Discerning Inherent Structures in a Digital Library of Formal Mathematics.  by Lorigo, Lori, Jon Kleinberg, Richard Eaton, and Robert L. Constable, International Conference on Mathematical Knowledge Management, Lecture Notes in Computer Science, Springer-Verlag, 2004.

       The Horus and Ensemble Projects: Accomplishments and Limitations  by Birman, Kenneth, Robert L. Constable, Mark Hayden, Jason Hickey, Christoph Kreitz, Robbert van Renesse, Ohad Rodeh, and Werner Vogels, Proceedings of DARPA Information Survivability Conference and Exhibition (DISCEX '00), 2000.

       Implementing Mathematics with the Nuprl Development System  by Constable, Robert L., Stuart F. Allen, H. M. Bromley, Walter Rance Cleaveland, J. F. Cremer, Robert W. Harper, Douglas J. Howe, Todd B. Knoblock, Nax P. Mendler, Prakash Panangaden, James T. Sasaki, and Scott F. Smith, Prentice-Hall:NJ, 1986.

       Implementing Metamathematics as an Approach to Automatic Theorem Proving  by Constable, Robert L., and Douglas J. Howe, Formal Techniques in Artificial Intelligence: A Source Book, R.B. Banerji (ed.), pp. 45-76, Elsevier Science Publishers:North-Holland, (also Cornell TR 89-982), 1990.

       Infinite Objects in Type Theory  by Mendler, Nax P., Robert L. Constable, and Prakash Panangaden, Proceedings of First IEEE Symposium on Logic in Computer Science, pp. 249-255, (also Cornell Technical Report 86-743), 1986.

       Information-Intensive Proof Technology  by Constable, Robert L., Lecture Notes for the Marktoberdorf NATO Summer School, 2003.

       Innovations in Computational Type Theory using Nuprl  by Allen, Stuart F., Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo, and Evan Moran, Journal of Applied Logic, Volume 4, Issue 4, December 2006, Pages 428-469, 2006.

       Knowledge-Based Synthesis of Distributed Systems Using Event Structures  by Bickford, Mark, Robert L. Constable, Joseph Y. Halpern, and Sabina Petride, Cornell University Technical Report 2004-1927, 2004.

       Knowledge-based synthesis of distributed systems using event structures.  by Bickford, Mark, Robert L. Constable, Joseph Y. Halpern, and Sabina Petride, In Franz Baader and Andreo Voronsky, editors, Logic for Programming, Artificial Intelligence, and Reasoning, volume 3452 of Lecture Notes in Computer Science, pages 449-465, 2005.

       Lectures on: Classical Proofs as Programs  by Constable, Robert L., Constructive Methods of Computing Science (NATO ASI Series), M. Broy (ed.), 1992.

       A Logic of Events  by Bickford, Mark, and Robert L. Constable, Cornell University Technical Report 2003-1893, 2003.

       Logical Aspects of Digital Mathematics Libraries (extended abstract)  by Allen, Stuart F., James L. Caldwell, and Robert L. Constable, Proceedings of First International Workshop on Mathematical Knowledge Management (MKM'01), RISC, A-4232 Schloss Hagenberg, Austria, 2001.

       Metalevel Programming in Constructive Type Theory  by Constable, Robert L., Programming and Mathematical Method (NATO ASI Series F: Computer and Systems Sciences), M. Broy (ed.), vol. 88, pp. 45-93, Springer-Verlag, 1992.

       Metalogical Frameworks  by Basin, David A., and Robert L. Constable, Proceedings of Second Annual Workshop on Logical Frameworks, (also Cornell Technical Report 91-1235), 1991.

       Metalogical Frameworks II: Developing a Reflected Decision Procedure  by Constable, Robert L., Journal of Automated Reasoning, Volume 22, Issue 2, pp. 171-221., 1999.

       MetaPRL -- A Modular Logical Environment  by Hickey, Jason, Aleksey Nogin, Robert L. Constable, Brian Aydemir, Eli Barzilay, and Lori Lorigo, Proceedings of 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'03), D. Basin and B. Wolff (eds.), LNCS 2758, pp. 287-303, Springer-Verlag, 2003.

       Naive Computational Type Theory  by Constable, Robert L., Proof and System-Reliability, H. Schwichtenberg and R. Steinbruggen (eds.), pp. 213-259, 2002.

       Nuprl as a General Logic  by Constable, Robert L., and Douglas J. Howe, Logic in Computer Science Academic Press, P. Odifreddi (ed.), pp. 77-90, (also Cornell Technical Report 89-1021), 1990.

       The Nuprl Open Logical Environment  by Allen, Stuart F., Robert L. Constable, Richard Eaton, Christoph Kreitz, and Lori Lorigo, Proceedings of 17th International Conference on Automated Deduction, LNAI 1831, pp. 170-176, Springer-Verlag, 2000.

       A Nuprl-PVS Connection: Integrating Libraries of Formal Mathematics  by Kleinberg, Jon, Mark Bickford, Robert L. Constable, Richard Eaton, and Christoph Kreitz, Cornell University Technical Report 2003-1889, 2003.

       Nuprl's Class Theory and Its Applications  by Constable, Robert L., and Jason Hickey, Foundations of Secure Computation, F. L. Bauer and R. Steinbruggen (eds.), pp. 91-115, IOS Press:Amsterdam, 2000.

       Partial Objects in Constructive Type Theory  by Smith, Scott F., and Robert L. Constable, Proceedings of Second IEEE Symposium on Logic in Computer Science, pp. 183-193, (also Cornell TR 87-822), 1987.

       Practical Reflection in Nuprl  by Barzilay, Eli, Stuart F. Allen, and Robert L. Constable, Proceedings of 18th IEEE Symposium on Logic in Computer Science, P. Kolaitis (ed.), 2003.

       A Programming Logic  by Constable, Robert L., and Michael J. O'Donnell, Winthrop, MA, 1978.

       Proofs as Programs  by Bates, Joseph L., and Robert L. Constable, ACM Transactions on Programming Languages and Systems, vol. 7, no. 1, pp. 53-71, (also Cornell University Technical Report 82-530), 1985.

       Protocol Switching: Exploiting Meta-Properties  by Liu, Xiaoming, Robbert van Renesse, Mark Bickford, Christoph Kreitz, and Robert L. Constable, ProceedingsInternational Workshop on Applied Reliable Group Communication (WARGC'01), IEEE Computer Society Press, 2001.

       Recent Results in Type Theory and Their Relationship to Automath  by Constable, Robert L., Thirty Five Years of Automating Mathematics, F. Kamareddine (ed.), pp. 1-11, Kluwer Academic Press, 2003.

       Recursive Definitions in Type Theory  by Constable, Robert L., and Nax P. Mendler, Proceedings of Logics of Progams Conference, pp. 61-78, (also Cornell Technical Report 85-659), 1985.

       Reflecting the Open-Ended Computation System of Constructive Type Theory  by Constable, Robert L., Stuart F. Allen, and Douglas J. Howe, Logic Algebra and Computation (NATO ASI Series), H. Schwichtenberg (ed.), vol. F79, 1990.

       Semantics of Evidence  by Constable, Robert L., Cornell University Technical Report 84-684, 1985.