Skip to main content

more options

Journal Articles

  1. Intuitionistic Completeness of First-Order Logic. In Annals of Pure and Applied Logic, Elsevier B.V., Vol. 165, Issue 1, 2014, pages 164198 (with M. Bickford).
  2. Knowledge-Based Synthesis of Distributed Systems Using Event Structures. In Logical Methods in Computer Science, Vol. 7, Issue 2, 2011, (with M. Bickford, J. Halpern, and S. Petride).
  3. Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics. In Logical Methods in Computer Science, Vol. 4, Issue 3, 2008, (with W. Moczydlowski).
  4. Transforming the Academy: Knowledge Formation in the Age of Digital Information, Physica Plus, Issue No. 9, Jan 2007.
  5. Innovations in Computational Type Theory using Nuprl. In Journal of Applied Logic, Vol. 4, Issue 4, 2006, Pages 428469,(with S. Allen, M. Bickford, R. Eaton, C. Kreitz, L. Lorigo, and E. Moran).
  6. Using Formal Reference to Enhance Authority and Integrity in Online Mathematical Texts. In Journal of Electronic Publishing, Vol. 9, No. 2, 2006 (with L. Lorigo and S. Allen).
  7. The Future of Departments. In Academic Leader, 19, 2003, pages 112 (with G. C. Altschuler).
  8. The Horus and Ensemble Projects: Accomplishments and Limitations. In DISCEX 00, Vol. I, 2000, pages 149161 (with K. Birman, M. Hayden, J. Hickey, C. Kreitz, R. van Renesse, O. Rodeh, and W. Vogels).
  9. Metalogical Frameworks II: Developing a Reflected Decision Procedure. In Journal of Automated Reasoning, Vol. 22(2), 1999, pages 171221 (with W. E. Aitken and J. L. Underwood).
  10. A Note on Complexity Measures for Inductive Classes in Constructive Type Theory. In Information and Computation, Vol. 143(2), 1998, pages 137153.
  11. Computational Foundations of Basic Recursive Function Theory. In Theoretical Computer Science B: Logic, Semantics, and Theory of Programming, Vol. 120, 1993, pages 89112 (with S. F. Smith).
  12. On Writing Programs that Construct Proofs. In Journal of Automated Reasoning, Vol. 1, 1985, pages 285326 (with T. Knoblock and J. Bates).
  13. Proofs as Programs. In Transactions on Programming Languages and Systems, Vol. 7(1), 1985, pages 113136.
  14. Remembrances of Errett Bishop. In Contemporary Mathematics, American Mathematical Society, Vol. 39, 1985, pages 79-84 (with A. Nerode and G. Metakides).
  15. Constructive Mathematics as a Programming Logic I: Some Principles of Theory. In Foundations of Computing Theory, Lecture Notes in Computer Science 158, Springer-Verlag, NY, 1983, pages 6477; also Annals of Discrete Mathematics, Vol. 24, 1985, pages 2138.
  16. The Type Theory of PL/CV3. In Logics of Programs, Lecture Notes in Computer Science 135, Springer-Verlag, 1982, pages 7293 (with D. Zlatin); also in Transactions on Programming Languages and Systems, Vol. 6(1), 1984, pages 94117.
  17. Programs as Proofs. In Information Processing Letters, Vol. 16(3), 1983, pages 105112.
  18. A Hierarchical Approach to Formal Semantics with Application to the Definition of PL/CS. In Transactions on Programming Languages and Systems, Vol. 1(1), 1979, pages 98114 (with J. Donahue).
  19. On Computational Complexity of Scheme Equivalence. In Proceedings of the Eighth Princeton Conference on Information Sciences and Systems, 1974; also SICOMP, Vol. 9(2), 1980, pages 396416 (with H. Hunt and S. Sahni).
  20. A Constructive Programming Logic. In Proceedings of the World Computer Congress of the IFIP 77, 1977, pages 733738.
  21. Computability Concepts for Programming Language Semantics. In Proceedings of the Seventh ACM Symposium on the Theory of Computing, 1975, pages 98105; also Theoretical Computer Science 2, 1976, pages 133145 (with H. Egli).
  22. Two Types of Hierarchy Theorem for Axiomatic Complexity Classes. In Courant Computer Science Symposium 7, Computational Complexity, Algorithmic Press, NY, 1973, pages 733738.
  23. The Operator Gap. In Proceedings of the Ninth IEEE Symposium on Switching and Automata Theory, 1969, pages 2026 (expanded in Journal of the ACM, Vol. 19(1), 1972, pages 175183).
  24. On the Efficiency of Programs in Subrecursive Formalisms. In Proceedings of the Tenth IEEE Symposium on Switching and Automata Theory, 1972, pages 6067; also as Subrecursive Programming Languages I; also, in Journal of the ACM, Vol. 19(3), 1972, pages 526586 (with A. Borodin).
  25. On Classes of Program Schemata. In SIAM Journal of Computing, Vol. 1(1), 1972, pages 66118 (with D. Gries).
  26. Subrecursive Program Schemata I Undecidable Equivalence Problems. In Proceedings of the Fourth Symposium on the Theory of Computing, 1972; also Journal of Computer and System Sciences Vol. 6(6), 1972, pages 480518 (with S. Muchnick).
  27. Constructive Mathematics and Automatic Program Writers. In Proceedings of the World Computer Congress of the IFIP, 1971, pages 229233.