PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A framework for defining logics
Journal of the ACM (JACM)
Cut-elimination for a logic with definitions and induction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
Cut Elimination for Logics with Definitional Reflection
Proceedings of the International Workshop on Nonclassical Logics and Information Processing
Abstract Syntax for Variable Binders: An Overview
CL '00 Proceedings of the First International Conference on Computational Logic
System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
COLOG '88 Proceedings of the International Conference on Computer Logic
A Proof Theory for Generic Judgments: An extended abstract
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Reasoning in a logic with definitions and induction
Reasoning in a logic with definitions and induction
Automating the meta theory of deductive systems
Automating the meta theory of deductive systems
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
A logical framework for reasoning about logical specifications
A logical framework for reasoning about logical specifications
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nominal Techniques in Isabelle/HOL
Journal of Automated Reasoning
Combining Generic Judgments with Recursive Definitions
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
The Bedwyr System for Model Checking over Syntactic Expressions
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
The Abella Interactive Theorem Prover (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Reasoning in Abella about Structural Operational Semantics Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressivity of Minimal Generic Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Proof search specifications of bisimulation and modal logics for the π-calculus
ACM Transactions on Computational Logic (TOCL)
A framework for specifying, prototyping, and reasoning about computational systems
A framework for specifying, prototyping, and reasoning about computational systems
Least and greatest fixed points in linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Focused inductive theorem proving
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.00 |
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state theorems about computational specifications. This logic is classical or intuitionistic and should contain strong proof principles such as induction and co-induction. The second level of logic, called the "specification logic", is used to specify computation. While computation can be specified using a number of formal techniques--e.g., Petri nets, process calculus, and state machines--we shall illustrate the merits and challenges of using logic programming-like specifications of computation.