Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Logic and computation: interactive proof with Cambridge LCF
Logic and computation: interactive proof with Cambridge LCF
Theoretical Computer Science
Influences of mathematical logic on computer science
A half-century survey on The Universal Turing Machine
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
From LCF to HOL: a short history
Proof, language, and interaction
Social processes and proofs of theorems and programs
Communications of the ACM
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Constructions: A Higher Order Proof System for Mechanizing Mathematics
EUROCAL '85 Invited Lectures from the European Conference on Computer Algebra-Volume I - Volume I
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Proceedings of the Conference on Logic of Programs
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Algorithmic specifications in linear logic with subexponentials
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
A Unified Sequent Calculus for Focused Proofs
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Least and greatest fixed points in linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Journal of Automated Reasoning
Incorporating tables into proofs
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Classical and intuitionistic subexponential logics are equally expressive
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
| Hi-index | 0.00 |
While logic was once developed to serve philosophers and mathematicians, it is increasingly serving the varied needs of computer scientists. In fact, recent decades have witnessed the creation of the new discipline of Computational Logic. While Computation Logic can claim involvement in diverse areas of computing, little has been done to systematize the foundations of this new discipline. Here, we envision a unity for Computational Logic organized around the proof theory of the sequent calculus: recent results in the area of focused proof systems will play a central role in developing this unity.