The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robert L. Constable: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amanda M. Holland-Minkley, Regina Barzilay, Robert L. Constable
    Verbalization of High-Level Formal Proofs. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1999, pp:277-284 [Conf]
  2. Stuart F. Allen, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo
    The Nuprl Open Logical Environment. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:170-176 [Conf]
  3. Robert L. Constable
    Exporting and Refecting Abstract Metamathematics. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:529- [Conf]
  4. Robert L. Constable, Wojciech Moczydlowski
    Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:162-176 [Conf]
  5. Robert L. Constable
    Constructive Mathematics as a Programming Logic I: Some Principles of Theory. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:64-77 [Conf]
  6. Allan Borodin, Robert L. Constable, John E. Hopcroft
    Dense and Non-Dense Families of Complexity Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:7-19 [Conf]
  7. John C. Cherniavsky, Robert L. Constable
    Representing Program Schemes in Logic [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:27-39 [Conf]
  8. Robert L. Constable
    The Operator Gap [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:20-26 [Conf]
  9. Robert L. Constable
    Programs and Types [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:118-128 [Conf]
  10. Robert L. Constable, Allan Borodin
    On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1970, pp:60-67 [Conf]
  11. Robert L. Constable, David Gries
    On Classes of Program Schemata [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:5-19 [Conf]
  12. Robert L. Constable
    Constructive Mathematics and Automatic Program Writers. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1971, pp:229-233 [Conf]
  13. Robert L. Constable
    A Constructive Programming Logic. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1977, pp:733-738 [Conf]
  14. Robert L. Constable
    Formal Theories and Software Systems: Fundamental Connections between Computer Science and Logic. [Citation Graph (0, 0)][DBLP]
    25th Anniversary of INRIA, 1992, pp:105-127 [Conf]
  15. Robert L. Constable
    Expressing Computational Complexity in Constructive Type Theory. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:131-144 [Conf]
  16. Stuart F. Allen, Robert L. Constable, Douglas J. Howe, William E. Aitken
    The Semantics of Reflected Proof [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:95-105 [Conf]
  17. Robert L. Constable
    Experience with Type Theory as a Foundation for Computer Science [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:266-279 [Conf]
  18. Robert L. Constable, Scott F. Smith
    Partial Objects In Constructive Type Theory [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:183-193 [Conf]
  19. Robert L. Constable, Scott F. Smith
    Computational Foundations of Basic Recursive Function Theory [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:360-371 [Conf]
  20. Todd B. Knoblock, Robert L. Constable
    Formalized Metareasoning in Type Theory [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:237-248 [Conf]
  21. N. P. Mendler, Prakash Panangaden, Robert L. Constable
    Infinite Objects in Type Theory [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:249-255 [Conf]
  22. Robert L. Constable
    Mathematics as Programming. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:116-128 [Conf]
  23. Robert L. Constable, N. P. Mendler
    Recursive Definitions in Type Theory. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1985, pp:61-78 [Conf]
  24. Robert L. Constable, Daniel R. Zlatin
    The Type Theory of PL/CV 3. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:72-93 [Conf]
  25. Mark Bickford, Robert L. Constable, Joseph Y. Halpern, Sabina Petride
    Knowledge-Based Synthesis of Distributed Systems Using Event Structures. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:449-465 [Conf]
  26. 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. [Citation Graph (0, 0)][DBLP]
    MKM, 2004, pp:220-235 [Conf]
  27. Robert L. Constable, Scott Johnson
    A PL/CV Precis. [Citation Graph (0, 0)][DBLP]
    POPL, 1979, pp:7-20 [Conf]
  28. Xiaoming Liu 0003, Christoph Kreitz, Robbert van Renesse, Jason Hickey, Mark Hayden, Kenneth P. Birman, Robert L. Constable
    Building reliable, high-performance communication systems from components. [Citation Graph (0, 0)][DBLP]
    SOSP, 1999, pp:80-92 [Conf]
  29. Robert L. Constable
    On the Size of Programs in Subrecursive Formalisms [Citation Graph (0, 0)][DBLP]
    STOC, 1970, pp:1-9 [Conf]
  30. Robert L. Constable
    Loop Schemata [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:24-39 [Conf]
  31. Robert L. Constable
    Type Two Computational Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:108-121 [Conf]
  32. Robert L. Constable
    On the Theory of Programming Logics [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:269-285 [Conf]
  33. Robert L. Constable, Juris Hartmanis
    Complexity of Formal Translations and Speed-Up Results [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:244-250 [Conf]
  34. Robert L. Constable, Steven S. Muchnick
    Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:1-17 [Conf]
  35. Herbert Egli, Robert L. Constable
    Computability Concepts for Programming Language Semantics [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:98-106 [Conf]
  36. Robert L. Constable
    Type Theory as a Foundation for Computer Science. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:226-243 [Conf]
  37. Robert L. Constable
    Partial functions in constructive formal theories. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:1-18 [Conf]
  38. Robert L. Constable
    ML Programming in Constructive Type Theory (abstract). [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1997, pp:87- [Conf]
  39. 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. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2003, pp:287-303 [Conf]
  40. Robert L. Constable
    A Note on Complexity Measures for Inductive Classes in Constructive Type Theory. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:143, n:2, pp:137-153 [Journal]
  41. Robert L. Constable
    Programs as Proofs: A Synopsis. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:3, pp:105-112 [Journal]
  42. Robert L. Constable
    The Operator Gap. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:1, pp:175-183 [Journal]
  43. Robert L. Constable, Allan Borodin
    Subrecursive Programming Languages, Part I: efficiency and program structure. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:3, pp:526-568 [Journal]
  44. Stuart F. Allen, Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo, E. Moran
    Innovations in computational type theory using Nuprl. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2006, v:4, n:4, pp:428-469 [Journal]
  45. William E. Aitken, Robert L. Constable, Judith L. Underwood
    Metalogical Frameworks II: Developing a Reflected Decision Procedure. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1999, v:22, n:2, pp:171-221 [Journal]
  46. Robert L. Constable, Todd B. Knoblock, Joseph L. Bates
    Writing Programs that Construct Proofs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1985, v:1, n:3, pp:285-326 [Journal]
  47. Robert L. Constable
    Subrecursive Programming Languages. II. On Program Size. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1971, v:5, n:3, pp:315-334 [Journal]
  48. Robert L. Constable, Steven S. Muchnick
    Subrecursive Program Schemata I & II: I. Undecidable Equivalence problems; II. Decidable Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1972, v:6, n:6, pp:480-537 [Journal]
  49. Robert L. Constable, David Gries
    On Classes of Program Schemata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1972, v:1, n:1, pp:66-118 [Journal]
  50. Harry B. Hunt III, Robert L. Constable, Sartaj Sahni
    On the Computational Complexity of Program Scheme Equivalence. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:396-416 [Journal]
  51. Robert L. Constable, Scott F. Smith
    Computational Foundations of Basic Recursive Function Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:89-112 [Journal]
  52. Herbert Egli, Robert L. Constable
    Computability Concepts for Programming Language Semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:2, pp:133-145 [Journal]
  53. Joseph L. Bates, Robert L. Constable
    Proofs as Programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1985, v:7, n:1, pp:113-136 [Journal]
  54. Robert L. Constable, James E. Donahue
    A Hierarchial Approach to Formal Semantics With Application to the Definition of PL/CS. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1979, v:1, n:1, pp:98-114 [Journal]
  55. Robert L. Constable, Daniel R. Zlatin
    The Type Theory of PL/CV3. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1984, v:6, n:1, pp:94-117 [Journal]
  56. Xiaoming Liu 0003, Robbert van Renesse, Mark Bickford, Christoph Kreitz, Robert L. Constable
    Protocol Switching: Exploiting Meta-Properties. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2001, pp:37-42 [Conf]
  57. Robert L. Constable, Wojciech Moczydlowski
    Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus. [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:147-161 [Conf]

  58. Constructively formalizing automata theory. [Citation Graph (, )][DBLP]


  59. Building Mathematics-Based Software Systems to Advance Science and Create Knowledge. [Citation Graph (, )][DBLP]


  60. Extracting the resolution algorithm from a completeness proof for the propositional calculus. [Citation Graph (, )][DBLP]


  61. Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics [Citation Graph (, )][DBLP]


  62. Knowledge-Based Synthesis of Distributed Systems Using Event Structures [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002