Year |
Citation |
Score |
2019 |
Rahli V, Bickford M, Cohen L, Constable RL. Bar Induction is Compatible with Constructive Type Theory Journal of the Acm. 66: 13. DOI: 10.1145/3305261 |
0.51 |
|
2019 |
Cohen L, Constable RL. Intuitionistic ancestral logic Journal of Logic and Computation. 29: 469-486. DOI: 10.1093/Logcom/Exv073 |
0.341 |
|
2019 |
Kellison A, Bickford M, Constable RL. Implementing Euclid’s straightedge and compass constructions in type theory Annals of Mathematics and Artificial Intelligence. 85: 175-192. DOI: 10.1007/S10472-018-9603-0 |
0.458 |
|
2017 |
Rahli V, Guaspari D, Bickford M, Constable RL. EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems Science of Computer Programming. 148: 26-48. DOI: 10.1016/J.Scico.2017.05.009 |
0.409 |
|
2015 |
Rahli V, Guaspari D, Bickford M, Constable RL. Formal Specification, Verification, and Implementation of Fault-Tolerant Systems using EventML Electronic Communication of the European Association of Software Science and Technology. 72. DOI: 10.14279/Tuj.Eceasst.72.1013 |
0.39 |
|
2015 |
Cohen L, Constable RL. Intuitionistic ancestral logic as a dependently typed abstract programming language Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9160: 14-26. DOI: 10.1007/978-3-662-47709-0_2 |
0.39 |
|
2014 |
Constable R, Bickford M. Intuitionistic completeness of first-order logic Annals of Pure and Applied Logic. 165: 164-198. DOI: 10.1016/J.Apal.2013.07.009 |
0.49 |
|
2012 |
Constable RL. On building constructive formal theories of computation noting the roles of turing, church, and brouwer Proceedings of the 2012 27th Annual Acm/Ieee Symposium On Logic in Computer Science, Lics 2012. 2-8. DOI: 10.1109/LICS.2012.9 |
0.387 |
|
2011 |
Bickford M, Constable R, Halpern JY, Petride S. Knowledge-based synthesis of distributed systems using event structures Logical Methods in Computer Science. 7. DOI: 10.2168/LMCS-7 (2:14) 2011 |
0.313 |
|
2009 |
Constable RL. Computational type theory Scholarpedia. 4: 7618. DOI: 10.4249/Scholarpedia.7618 |
0.428 |
|
2009 |
Constable R, Moczydłowski W. Extracting the resolution algorithm from a completeness proof for the propositional calculus Annals of Pure and Applied Logic. 161: 337-348. DOI: 10.1016/J.Apal.2009.07.008 |
0.654 |
|
2009 |
Constable RL. Building mathematics-based software systems to advance science and create knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5760: 3-17. DOI: 10.1007/978-3-642-03456-5_1 |
0.449 |
|
2008 |
Constable RL, Moczydłowski W. Extracting programs from constructive hol proofs via IZF set-theoretic semantics Logical Methods in Computer Science. 4. DOI: 10.2168/Lmcs-4(3:5)2008 |
0.674 |
|
2006 |
Lorigo L, Allen S, Constable R. Using formal reference to enhance authority and integrity in online mathematical texts Journal of Electronic Publishing. 9. DOI: 10.3998/3336451.0009.205 |
0.654 |
|
2006 |
Allen SF, Bickford M, Constable RL, Eaton R, Kreitz C, Lorigo L, Moran E. Innovations in computational type theory using Nuprl Journal of Applied Logic. 4: 428-469. DOI: 10.1016/J.Jal.2005.10.005 |
0.688 |
|
1999 |
Aitken WE, Constable RL, Underwood JL. Metalogical Frameworks II: Developing a Reflected Decision Procedure Journal of Automated Reasoning. 22: 171-221. DOI: 10.1023/A:1005929703675 |
0.349 |
|
1998 |
Constable RL. Chapter X - Types in Logic, Mathematics and Programming Studies in Logic and the Foundations of Mathematics. 137: 683-786. DOI: 10.1016/S0049-237X(98)80025-6 |
0.382 |
|
1998 |
Constable RL. A note on complexity measures for inductive classes in constructive type theory Information & Computation. 143: 137-153. DOI: 10.1006/Inco.1998.9999 |
0.497 |
|
1993 |
Constable RL, Smith SF. Computational foundations of basic recursive function theory Theoretical Computer Science. 121: 89-112. DOI: 10.1016/0304-3975(93)90085-8 |
0.494 |
|
1991 |
Constable RL. PX: A computational logic Science of Computer Programming. 17: 252-253. DOI: 10.1016/0167-6423(91)90043-W |
0.31 |
|
1985 |
Bates JL, Constable RL. Proofs as programs Acm Transactions On Programming Languages and Systems. 7: 113-136. DOI: 10.1145/2363.2528 |
0.396 |
|
1985 |
Constable RL, Knoblock TB, Bates JL. Writing programs that construct proofs Journal of Automated Reasoning. 1: 285-326. DOI: 10.1007/Bf00244273 |
0.412 |
|
1985 |
Constable RL. Constructive mathematics as a programming logic I: some principles of theory North-Holland Mathematics Studies. 102: 21-37. DOI: 10.1007/3-540-12689-9_94 |
0.476 |
|
1984 |
Constable RL, Zlatin DR. The Type Theory of PL/CV3 Acm Transactions On Programming Languages and Systems. 6: 94-117. DOI: 10.1145/357233.357238 |
0.501 |
|
1983 |
Constable RL. Programs as proofs: a synopsis Information Processing Letters. 16: 105-112. DOI: 10.1016/0020-0190(83)90060-1 |
0.418 |
|
1983 |
Constable RL. Partial functions in constructive formal theories Theoretical Computer Science. 1-18. DOI: 10.1007/Bfb0036465 |
0.486 |
|
1981 |
Constable RL. VERking in constructive set theory Acm Sigsoft Software Engineering Notes. 6: 58-60. DOI: 10.1145/1010832.1010854 |
0.481 |
|
1980 |
Hunt HB, Constable RL, Sahni S. On the Computational Complexity of Program Scheme Equivalence Siam Journal On Computing. 9: 396-416. DOI: 10.1137/0209031 |
0.329 |
|
1980 |
Constable RL. The Role of Finite Automata in the Development of Modern Computing Theory Studies in Logic and the Foundations of Mathematics. 101: 61-83. DOI: 10.1016/S0049-237X(08)71253-9 |
0.474 |
|
1979 |
Constable RL, Donahue JE. A Hierarchical Approach to Formal Semantics With Application to the Definition of PL/ CS Acm Transactions On Programming Languages and Systems. 1: 98-114. DOI: 10.1145/357062.357069 |
0.335 |
|
1976 |
Constable RL, Blum EK, Harrison MA. Special SIGACT issue: Sixth Annual ACM Symposium on Theory of Computing Journal of Computer and System Sciences. 12. DOI: 10.1016/S0022-0000(76)80033-5 |
0.39 |
|
1976 |
Egli H, Constable RL. Computability concepts for programming language semantics Theoretical Computer Science. 2: 133-145. DOI: 10.1016/0304-3975(76)90029-3 |
0.503 |
|
1972 |
Constable RL, Borodin AB. Subrecursive Programming Languages, Part I: Efficiency and program structure Journal of the Acm (Jacm). 19: 526-568. DOI: 10.1145/321707.321721 |
0.646 |
|
1972 |
Constable RL. The Operator Gap Journal of the Acm. 19: 175-183. DOI: 10.1145/321679.321692 |
0.327 |
|
1972 |
Constable RL, Muchnick SS. Subrecursive program schemata I & II: I. Undecidable equivalence problems; II. Decidable equivalence problems Journal of Computer and System Sciences. 6: 480-537. DOI: 10.1016/S0022-0000(72)80029-1 |
0.385 |
|
1971 |
Constable RL. Subrecursive programming languages II on program size Journal of Computer and System Sciences. 5: 315-334. DOI: 10.1016/S0022-0000(71)80039-9 |
0.411 |
|
Show low-probability matches. |