Robert L. Constable
Affiliations:- Cornell University, Ithaca, USA
According to our database1,
Robert L. Constable
authored at least 78 papers
between 1969 and 2021.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 1995, "For fundamental contributions to the field of logic and its computational aspects, especially his work on providing mechanical assistance in problem solving through the software system Nuprl.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2021
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021
2019
Ann. Math. Artif. Intell., 2019
2018
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
2017
EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems.
Sci. Comput. Program., 2017
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
2015
Formal Specification, Verification, and Implementation of Fault-Tolerant Systems using EventML.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015
Proceedings of the Logic, Language, Information, and Computation, 2015
2014
Proceedings of the 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2014
2012
Proceedings of the Sets and Extensions in the Twentieth Century, 2012
Proceedings of the Second International Workshop on Proof Exchange for Theorem Proving, 2012
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012
Proceedings of the 20th IEEE International Conference on Network Protocols, 2012
Proceedings of the Eighth Workshop on Hot Topics in System Dependability, HotDep 2012, 2012
2011
Effectively Nonblocking Consensus Procedures Can Execute Forever - a Constructive Version of FLP
CoRR, 2011
Log. Methods Comput. Sci., 2011
2009
Extracting the resolution algorithm from a completeness proof for the propositional calculus.
Ann. Pure Appl. Log., 2009
Proceedings of the Efficient Algorithms, 2009
2008
Log. Methods Comput. Sci., 2008
2006
2004
A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics.
Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004
2003
Proceedings of the Theorem Proving in Higher Order Logics, 16th International Conference, 2003
2001
Proceedings of the 21st International Conference on Distributed Computing Systems Workshops (ICDCS 2001 Workshops), 2001
2000
Constructively formalizing automata theory.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000
1999
J. Autom. Reason., 1999
Proceedings of the 17th ACM Symposium on Operating System Principles, 1999
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999
1998
Inf. Comput., 1998
1997
Proceedings of the Theorem Proving in Higher Order Logics, 10th International Conference, 1997
1995
Proceedings of the Proceedings, 1995
1994
Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994
1993
Theor. Comput. Sci., 1993
1992
Formal Theories and Software Systems: Fundamental Connections between Computer Science and Logic.
Proceedings of the Future Tendencies in Computer Science, 1992
1991
Proceedings of the Theoretical Aspects of Computer Software, 1991
1990
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990
1987
Partial Objects In Constructive Type Theory
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987
1986
Infinite Objects in Type Theory
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986
Formalized Metareasoning in Type Theory
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986
Prentice Hall, ISBN: 978-0-13-451832-9, 1986
1985
1984
1983
Proceedings of the Theoretical Computer Science, 1983
Proceedings of the Fundamentals of Computation Theory, 1983
1982
Lecture Notes in Computer Science 135, Springer, ISBN: 3-540-11492-0, 1982
1981
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981
1980
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980
1979
A Hierarchial Approach to Formal Semantics With Application to the Definition of PL/CS.
ACM Trans. Program. Lang. Syst., 1979
Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979
1977
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977
A Constructive Programming Logic.
Proceedings of the Information Processing, 1977
1976
1974
SIGACT News, 1974
1973
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973
1972
Subrecursive Program Schemata I & II: I. Undecidable Equivalence problems; II. Decidable Equivalence Problems.
J. Comput. Syst. Sci., 1972
J. ACM, 1972
Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972
1971
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971
Constructive Mathematics and Automatic Program Writers.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971
1970
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970
On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract)
Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970
1969
Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969