![]() | ![]() |
| 2012 | ||
|---|---|---|
| 71 | Robert L. Constable, Alexandra Silva: Logic and Program Semantics - Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday Springer 2012 | |
| 2011 | ||
| 70 | Robert L. Constable: Effectively Nonblocking Consensus Procedures Can Execute Forever - a Constructive Version of FLP CoRR abs/1109.3370: (2011) | |
| 69 | Robert L. Constable, Mark Bickford: Intuitionistic Completeness of First-Order Logic CoRR abs/1110.1614: (2011) | |
| 68 | 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) | |
| 2009 | ||
| 67 | Robert L. Constable: Building Mathematics-Based Software Systems to Advance Science and Create Knowledge. Efficient Algorithms 2009: 3-17 | |
| 66 | 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) | |
| 65 | Robert L. Constable: Computational type theory. Scholarpedia 4(2): 7618 (2009) | |
| 2008 | ||
| 64 | Robert L. Constable, Wojciech Moczydlowski: Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics CoRR abs/0806.1281: (2008) | |
| 63 | Robert L. Constable, Wojciech Moczydlowski: Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics. Logical Methods in Computer Science 4(3): (2008) | |
| 2007 | ||
| 62 | Robert L. Constable, Wojciech Moczydlowski: Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus. LFCS 2007: 147-161 | |
| 2006 | ||
| 61 | Robert L. Constable, Wojciech Moczydlowski: Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics. IJCAR 2006: 162-176 | |
| 60 | 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) | |
| 2004 | ||
| 59 | Mark Bickford, Robert L. Constable, Joseph Y. Halpern, Sabina Petride: Knowledge-Based Synthesis of Distributed Systems Using Event Structures. LPAR 2004: 449-465 | |
| 58 | 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 | |
| 2003 | ||
| 57 | 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 | |
| 2001 | ||
| 56 | Xiaoming Liu, Robbert van Renesse, Mark Bickford, Christoph Kreitz, Robert L. Constable: Protocol Switching: Exploiting Meta-Properties. ICDCS Workshops 2001: 37-42 | |
| 2000 | ||
| 55 | Stuart F. Allen, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo: The Nuprl Open Logical Environment. CADE 2000: 170-176 | |
| 54 | Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan C. Uribe: Constructively formalizing automata theory. Proof, Language, and Interaction 2000: 213-238 | |
| 1999 | ||
| 53 | Amanda M. Holland-Minkley, Regina Barzilay, Robert L. Constable: Verbalization of High-Level Formal Proofs. AAAI/IAAI 1999: 277-284 | |
| 52 | 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 | |
| 51 | 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) | |
| 1998 | ||
| 50 | Robert L. Constable: A Note on Complexity Measures for Inductive Classes in Constructive Type Theory. Inf. Comput. 143(2): 137-153 (1998) | |
| 1997 | ||
| 49 | Robert L. Constable: ML Programming in Constructive Type Theory (abstract). TPHOLs 1997: 87 | |
| 1995 | ||
| 48 | Robert L. Constable: Experience with Type Theory as a Foundation for Computer Science LICS 1995: 266-279 | |
| 1994 | ||
| 47 | Robert L. Constable: Exporting and Refecting Abstract Metamathematics. CADE 1994: 529 | |
| 46 | Robert L. Constable: Expressing Computational Complexity in Constructive Type Theory. LCC 1994: 131-144 | |
| 1993 | ||
| 45 | Robert L. Constable, Scott F. Smith: Computational Foundations of Basic Recursive Function Theory. Theor. Comput. Sci. 121(1&2): 89-112 (1993) | |
| 1992 | ||
| 44 | Robert L. Constable: Formal Theories and Software Systems: Fundamental Connections between Computer Science and Logic. 25th Anniversary of INRIA 1992: 105-127 | |
| 1991 | ||
| 43 | Robert L. Constable: Type Theory as a Foundation for Computer Science. TACS 1991: 226-243 | |
| 1990 | ||
| 42 | Stuart F. Allen, Robert L. Constable, Douglas J. Howe, William E. Aitken: The Semantics of Reflected Proof LICS 1990: 95-105 | |
| 1988 | ||
| 41 | Robert L. Constable, Scott F. Smith: Computational Foundations of Basic Recursive Function Theory LICS 1988: 360-371 | |
| 1987 | ||
| 40 | Robert L. Constable, Scott F. Smith: Partial Objects In Constructive Type Theory LICS 1987: 183-193 | |
| 1986 | ||
| 39 | 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: I-X, 1-299 | |
| 38 | Todd B. Knoblock, Robert L. Constable: Formalized Metareasoning in Type Theory LICS 1986: 237-248 | |
| 37 | N. P. Mendler, Prakash Panangaden, Robert L. Constable: Infinite Objects in Type Theory LICS 1986: 249-255 | |
| 1985 | ||
| 36 | Robert L. Constable, N. P. Mendler: Recursive Definitions in Type Theory. Logic of Programs 1985: 61-78 | |
| 35 | Joseph L. Bates, Robert L. Constable: Proofs as Programs. ACM Trans. Program. Lang. Syst. 7(1): 113-136 (1985) | |
| 34 | Robert L. Constable, Todd B. Knoblock, Joseph L. Bates: Writing Programs that Construct Proofs. J. Autom. Reasoning 1(3): 285-326 (1985) | |
| 1984 | ||
| 33 | Robert L. Constable, Daniel R. Zlatin: The Type Theory of PL/CV3. ACM Trans. Program. Lang. Syst. 6(1): 94-117 (1984) | |
| 1983 | ||
| 32 | Robert L. Constable: Constructive Mathematics as a Programming Logic I: Some Principles of Theory. FCT 1983: 64-77 | |
| 31 | Robert L. Constable: Mathematics as Programming. Logic of Programs 1983: 116-128 | |
| 30 | Robert L. Constable: Partial functions in constructive formal theories. Theoretical Computer Science 1983: 1-18 | |
| 29 | Robert L. Constable: Programs as Proofs: A Synopsis. Inf. Process. Lett. 16(3): 105-112 (1983) | |
| 1982 | ||
| 28 | Robert L. Constable, Scott Johnson, C. D. Eichenlaub: An Introduction to the PL/CV2 Programming Logic Springer 1982 | |
| 1981 | ||
| 27 | Robert L. Constable, Daniel R. Zlatin: The Type Theory of PL/CV 3. Logic of Programs 1981: 72-93 | |
| 1980 | ||
| 26 | Robert L. Constable: Programs and Types FOCS 1980: 118-128 | |
| 25 | 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) | |
| 1979 | ||
| 24 | Robert L. Constable, Scott Johnson: A PL/CV Precis. POPL 1979: 7-20 | |
| 23 | 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) | |
| 1977 | ||
| 22 | Robert L. Constable: A Constructive Programming Logic. IFIP Congress 1977: 733-738 | |
| 21 | Robert L. Constable: On the Theory of Programming Logics STOC 1977: 269-285 | |
| 1976 | ||
| 20 | Herbert Egli, Robert L. Constable: Computability Concepts for Programming Language Semantics. Theor. Comput. Sci. 2(2): 133-145 (1976) | |
| 1975 | ||
| 19 | Herbert Egli, Robert L. Constable: Computability Concepts for Programming Language Semantics STOC 1975: 98-106 | |
| 1974 | ||
| 18 | Robert L. Constable, Robert W. Ritchie, Jack W. Carlyle, Michael A. Harrison: Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1974, Seattle, Washington, USA ACM 1974 | |
| 1973 | ||
| 17 | Alfred V. Aho, Allan Borodin, Robert L. Constable, Robert W. Floyd, Michael A. Harrison, Richard M. Karp, H. Raymond Strong: Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA ACM 1973 | |
| 16 | Robert L. Constable: Type Two Computational Complexity STOC 1973: 108-121 | |
| 1972 | ||
| 15 | Robert L. Constable, Steven S. Muchnick: Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems STOC 1972: 1-17 | |
| 14 | John C. Cherniavsky, Robert L. Constable: Representing Program Schemes in Logic SWAT (FOCS) 1972: 27-39 | |
| 13 | Robert L. Constable: The Operator Gap. J. ACM 19(1): 175-183 (1972) | |
| 12 | Robert L. Constable, Allan Borodin: Subrecursive Programming Languages, Part I: efficiency and program structure. J. ACM 19(3): 526-568 (1972) | |
| 11 | 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) | |
| 10 | Robert L. Constable, David Gries: On Classes of Program Schemata. SIAM J. Comput. 1(1): 66-118 (1972) | |
| 1971 | ||
| 9 | Robert L. Constable: Constructive Mathematics and Automatic Program Writers. IFIP Congress (1) 1971: 229-233 | |
| 8 | Robert L. Constable: Loop Schemata STOC 1971: 24-39 | |
| 7 | Robert L. Constable, Juris Hartmanis: Complexity of Formal Translations and Speed-Up Results STOC 1971: 244-250 | |
| 6 | Robert L. Constable, David Gries: On Classes of Program Schemata SWAT (FOCS) 1971: 5-19 | |
| 5 | Robert L. Constable: Subrecursive Programming Languages. II. On Program Size. J. Comput. Syst. Sci. 5(3): 315-334 (1971) | |
| 1970 | ||
| 4 | Robert L. Constable: On the Size of Programs in Subrecursive Formalisms STOC 1970: 1-9 | |
| 3 | Robert L. Constable, Allan Borodin: On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract) SWAT (FOCS) 1970: 60-67 | |
| 1969 | ||
| 2 | Robert L. Constable: The Operator Gap SWAT (FOCS) 1969: 20-26 | |
| 1 | Allan Borodin, Robert L. Constable, John E. Hopcroft: Dense and Non-Dense Families of Complexity Classes SWAT (FOCS) 1969: 7-19 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page