| 2021 | CSL | Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle. | Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli |
| 2018 | LICS | Computability Beyond Church-Turing via Choice Sequences. | Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli |
| 2017 | LICS | Bar induction: The good, the bad, and the ugly. | Vincent Rahli, Mark Bickford, Robert L. Constable |
| 2015 | WoLLIC | Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language. | Liron Cohen, Robert L. Constable |
| 2014 | DSN | Developing Correctly Replicated Databases Using Formal Tools. | Nicolas Schiper, Vincent Rahli, Robbert van Renesse, Mark Bickford, Robert L. Constable |
| 2012 | CADE | Proof Assistants and the Dynamic Nature of Formal Theories. | Robert L. Constable |
| 2012 | ICNP | A diversified and correct-by-construction broadcast service. | Vincent Rahli, Nicolas Schiper, Robbert van Renesse, Mark Bickford, Robert L. Constable |
| 2012 | LICS | On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer. | Robert L. Constable |
| 2007 | LFCS | Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus. | Robert L. Constable, Wojciech Moczydlowski |
| 2006 | CADE | Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics. | Robert L. Constable, Wojciech Moczydlowski |
| 2004 | LPAR | Knowledge-Based Synthesis of Distributed Systems Using Event Structures. | Mark Bickford, Robert L. Constable, Joseph Y. Halpern, Sabina Petride |
| 2000 | CADE | The Nuprl Open Logical Environment. | Stuart F. Allen, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo |
| 1999 | AAAI | Verbalization of High-Level Formal Proofs. | Amanda M. Holland-Minkley, Regina Barzilay, Robert L. Constable |
| 1999 | SOSP | Building reliable, high-performance communication systems from components. | Xiaoming Liu, Christoph Kreitz, Robbert van Renesse, Jason Hickey, Mark Hayden, Kenneth P. Birman, Robert L. Constable |
| 1995 | LICS | Experience with Type Theory as a Foundation for Computer Science | Robert L. Constable |
| 1994 | CADE | Exporting and Refecting Abstract Metamathematics. | Robert L. Constable |
| 1990 | LICS | The Semantics of Reflected Proof | Stuart F. Allen, Robert L. Constable, Douglas J. Howe, William E. Aitken |
| 1988 | LICS | Computational Foundations of Basic Recursive Function Theory | Robert L. Constable, Scott F. Smith |
| 1987 | LICS | Partial Objects In Constructive Type Theory | Robert L. Constable, Scott F. Smith |
| 1986 | LICS | Formalized Metareasoning in Type Theory | Todd B. Knoblock, Robert L. Constable |
| 1986 | LICS | Infinite Objects in Type Theory | Nax Paul Mendler, Prakash Panangaden, Robert L. Constable |
| 1983 | FCT | Constructive Mathematics as a Programming Logic I: Some Principles of Theory. | Robert L. Constable |
| 1980 | FOCS | Programs and Types | Robert L. Constable |
| 1979 | POPL | A PL/CV Precis. | Robert L. Constable, Scott Johnson |
| 1977 | STOC | On the Theory of Programming Logics | Robert L. Constable |
| 1975 | STOC | Computability Concepts for Programming Language Semantics | Herbert Egli, Robert L. Constable |
| 1973 | STOC | Type Two Computational Complexity | Robert L. Constable |
| 1972 | FOCS | Representing Program Schemes in Logic | John C. Cherniavsky, Robert L. Constable |
| 1972 | STOC | Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems | Robert L. Constable, Steven S. Muchnick |
| 1971 | FOCS | On Classes of Program Schemata | Robert L. Constable, David Gries |
| 1971 | STOC | Loop Schemata | Robert L. Constable |
| 1971 | STOC | Complexity of Formal Translations and Speed-Up Results | Robert L. Constable, Juris Hartmanis |
| 1970 | FOCS | On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract) | Robert L. Constable, Allan Borodin |
| 1970 | STOC | On the Size of Programs in Subrecursive Formalisms | Robert L. Constable |
| 1969 | FOCS | Dense and Non-Dense Families of Complexity Classes | Allan Borodin, Robert L. Constable, John E. Hopcroft |
| 1969 | FOCS | The Operator Gap | Robert L. Constable |