Robert L. Constable

Vincent Rahli, Nicolas Schiper, Robbert van Renesse, Mark Bickford, Robert L. Constable: A diversified and correct-by-construction broadcast service. ICNP 2012: 1-6

Robert L. Constable: On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer. LICS 2012: 2-8

Robert L. Constable, Alexandra Silva (Eds.): Logic and Program Semantics - Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 7230, Springer 2012, isbn 978-3-642-29484-6

Mark Bickford, Robert L. Constable, Joseph Y. Halpern, Sabina Petride: Knowledge-Based Synthesis of Distributed Systems Using Event Structures. Logical Methods in Computer Science 7(2) (2011)

Robert L. Constable: Effectively Nonblocking Consensus Procedures Can Execute Forever - a Constructive Version of FLP. CoRR abs/1109.3370 (2011)

Robert L. Constable, Mark Bickford: Intuitionistic Completeness of First-Order Logic. CoRR abs/1110.1614 (2011)

Robert L. Constable, Wojciech Moczydlowski: Extracting the resolution algorithm from a completeness proof for the propositional calculus. Ann. Pure Appl. Logic 161(3): 337-348 (2009)

Robert L. Constable: Computational type theory. Scholarpedia 4(2): 7618 (2009)

Robert L. Constable: Building Mathematics-Based Software Systems to Advance Science and Create Knowledge. Efficient Algorithms 2009: 3-17

Robert L. Constable, Wojciech Moczydlowski: Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics. Logical Methods in Computer Science 4(3) (2008)

Robert L. Constable, Wojciech Moczydlowski: Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics. CoRR abs/0806.1281 (2008)

Robert L. Constable, Wojciech Moczydlowski: Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus. LFCS 2007: 147-161

Stuart F. Allen, Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo, E. Moran: Innovations in computational type theory using Nuprl. J. Applied Logic 4(4): 428-469 (2006)

Robert L. Constable, Wojciech Moczydlowski: Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics. IJCAR 2006: 162-176

Mark Bickford, Robert L. Constable, Joseph Y. Halpern, Sabina Petride: Knowledge-Based Synthesis of Distributed Systems Using Event Structures. LPAR 2004: 449-465

Lori Lorigo, Jon M. Kleinberg, Richard Eaton, Robert L. Constable: A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics. MKM 2004: 220-235

Jason Hickey, Aleksey Nogin, Robert L. Constable, Brian E. Aydemir, Eli Barzilay, Yegor Bryukhov, Richard Eaton, Adam Granicz, Alexei Kopylov, Christoph Kreitz, Vladimir Krupski, Lori Lorigo, Stephan Schmitt, Carl Witty, Xin Yu: MetaPRL - A Modular Logical Environment. TPHOLs 2003: 287-303

Xiaoming Liu, Robbert van Renesse, Mark Bickford, Christoph Kreitz, Robert L. Constable: Protocol Switching: Exploiting Meta-Properties. ICDCS Workshops 2001: 37-42

Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan C. Uribe: Constructively formalizing automata theory. Proof, Language, and Interaction 2000: 213-238

Stuart F. Allen, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo: The Nuprl Open Logical Environment. CADE 2000: 170-176

William E. Aitken, Robert L. Constable, Judith L. Underwood: Metalogical Frameworks II: Developing a Reflected Decision Procedure. J. Autom. Reasoning 22(2): 171-221 (1999)

Amanda M. Holland-Minkley, Regina Barzilay, Robert L. Constable: Verbalization of High-Level Formal Proofs. AAAI/IAAI 1999: 277-284

Xiaoming Liu, Christoph Kreitz, Robbert van Renesse, Jason Hickey, Mark Hayden, Kenneth P. Birman, Robert L. Constable: Building reliable, high-performance communication systems from components. SOSP 1999: 80-92

Robert L. Constable: A Note on Complexity Measures for Inductive Classes in Constructive Type Theory. Inf. Comput. 143(2): 137-153 (1998)

Robert L. Constable: ML Programming in Constructive Type Theory (abstract). TPHOLs 1997: 87

Robert L. Constable: Experience with Type Theory as a Foundation for Computer Science. LICS 1995: 266-279

Robert L. Constable: Exporting and Refecting Abstract Metamathematics. CADE 1994: 529

Robert L. Constable: Expressing Computational Complexity in Constructive Type Theory. LCC 1994: 131-144

Robert L. Constable, Scott F. Smith: Computational Foundations of Basic Recursive Function Theory. Theor. Comput. Sci. 121(1&2): 89-112 (1993)

Robert L. Constable: Formal Theories and Software Systems: Fundamental Connections between Computer Science and Logic. 25th Anniversary of INRIA 1992: 105-127

Robert L. Constable: Type Theory as a Foundation for Computer Science. TACS 1991: 226-243

Stuart F. Allen, Robert L. Constable, Douglas J. Howe, William E. Aitken: The Semantics of Reflected Proof. LICS 1990: 95-105

Robert L. Constable, Scott F. Smith: Computational Foundations of Basic Recursive Function Theory. LICS 1988: 360-371

Robert L. Constable, Scott F. Smith: Partial Objects In Constructive Type Theory. LICS 1987: 183-193

Robert L. Constable, Stuart F. Allen, Mark Bromley, Rance Cleaveland, J. F. Cremer, R. W. Harper, Douglas J. Howe, Todd B. Knoblock, N. P. Mendler, Prakash Panangaden, James T. Sasaki, Scott F. Smith: Implementing mathematics with the Nuprl proof development system. Prentice Hall 1986, isbn 978-0-13-451832-9, pp. I-X, 1-299

Todd B. Knoblock, Robert L. Constable: Formalized Metareasoning in Type Theory. LICS 1986: 237-248

N. P. Mendler, Prakash Panangaden, Robert L. Constable: Infinite Objects in Type Theory. LICS 1986: 249-255

Robert L. Constable, Todd B. Knoblock, Joseph L. Bates: Writing Programs that Construct Proofs. J. Autom. Reasoning 1(3): 285-326 (1985)

Joseph L. Bates, Robert L. Constable: Proofs as Programs. ACM Trans. Program. Lang. Syst. 7(1): 113-136 (1985)

Robert L. Constable, N. P. Mendler: Recursive Definitions in Type Theory. Logic of Programs 1985: 61-78

Robert L. Constable, Daniel R. Zlatin: The Type Theory of PL/CV3. ACM Trans. Program. Lang. Syst. 6(1): 94-117 (1984)

Robert L. Constable: Programs as Proofs: A Synopsis. Inf. Process. Lett. 16(3): 105-112 (1983)

Robert L. Constable: Constructive Mathematics as a Programming Logic I: Some Principles of Theory. FCT 1983: 64-77

Robert L. Constable: Mathematics as Programming. Logic of Programs 1983: 116-128

Robert L. Constable: Partial functions in constructive formal theories. Theoretical Computer Science 1983: 1-18

Robert L. Constable, Scott Johnson, C. D. Eichenlaub: An Introduction to the PL/CV2 Programming Logic. Lecture Notes in Computer Science 135, Springer 1982, isbn 3-540-11492-0

Robert L. Constable, Daniel R. Zlatin: The Type Theory of PL/CV 3. Logic of Programs 1981: 72-93

Harry B. Hunt III, Robert L. Constable, Sartaj Sahni: On the Computational Complexity of Program Scheme Equivalence. SIAM J. Comput. 9(2): 396-416 (1980)

Robert L. Constable: Programs and Types. FOCS 1980: 118-128

Robert L. Constable, James E. Donahue: A Hierarchial Approach to Formal Semantics With Application to the Definition of PL/CS. ACM Trans. Program. Lang. Syst. 1(1): 98-114 (1979)

Robert L. Constable, Scott Johnson: A PL/CV Precis. POPL 1979: 7-20

Robert L. Constable: A Constructive Programming Logic. IFIP Congress 1977: 733-738

Robert L. Constable: On the Theory of Programming Logics. STOC 1977: 269-285

Herbert Egli, Robert L. Constable: Computability Concepts for Programming Language Semantics. Theor. Comput. Sci. 2(2): 133-145 (1976)

Herbert Egli, Robert L. Constable: Computability Concepts for Programming Language Semantics. STOC 1975: 98-106

Robert L. Constable, Robert W. Ritchie, Jack W. Carlyle, Michael A. Harrison (Eds.): Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1974, Seattle, Washington, USA. ACM 1974

Robert L. Constable: Type Two Computational Complexity. STOC 1973: 108-121

Alfred V. Aho, Allan Borodin, Robert L. Constable, Robert W. Floyd, Michael A. Harrison, Richard M. Karp, H. Raymond Strong (Eds.): Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA. ACM 1973

Robert L. Constable: The Operator Gap. J. ACM 19(1): 175-183 (1972)

Robert L. Constable, Allan Borodin: Subrecursive Programming Languages, Part I: efficiency and program structure. J. ACM 19(3): 526-568 (1972)

Robert L. Constable, Steven S. Muchnick: Subrecursive Program Schemata I & II: I. Undecidable Equivalence problems; II. Decidable Equivalence Problems. J. Comput. Syst. Sci. 6(6): 480-537 (1972)

Robert L. Constable, David Gries: On Classes of Program Schemata. SIAM J. Comput. 1(1): 66-118 (1972)

John C. Cherniavsky, Robert L. Constable: Representing Program Schemes in Logic. SWAT (FOCS) 1972: 27-39

Robert L. Constable, Steven S. Muchnick: Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems. STOC 1972: 1-17

Robert L. Constable: Subrecursive Programming Languages. II. On Program Size. J. Comput. Syst. Sci. 5(3): 315-334 (1971)

Robert L. Constable, David Gries: On Classes of Program Schemata. SWAT (FOCS) 1971: 5-19

Robert L. Constable: Constructive Mathematics and Automatic Program Writers. IFIP Congress (1) 1971: 229-233

Robert L. Constable: Loop Schemata. STOC 1971: 24-39

Robert L. Constable, Juris Hartmanis: Complexity of Formal Translations and Speed-Up Results. STOC 1971: 244-250

Robert L. Constable, Allan Borodin: On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract). SWAT (FOCS) 1970: 60-67

Robert L. Constable: On the Size of Programs in Subrecursive Formalisms. STOC 1970: 1-9

Allan Borodin, Robert L. Constable, John E. Hopcroft: Dense and Non-Dense Families of Complexity Classes. SWAT (FOCS) 1969: 7-19

Robert L. Constable: The Operator Gap. SWAT (FOCS) 1969: 20-26