154 search results - page 4 / 31 » Using Proofs by Coinduction to Find |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
APLAS
2010
ACM
13 years 8 months ago
2010
ACM
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 th...
ENTCS
2002
13 years 7 months ago
2002
We give a short description of Hybrid, a new tool for interactive theorem proving, s introduced in [4]. It provides a form of Higher Order Abstract Syntax (HOAS) combined consiste...
ENTCS
2000
13 years 7 months ago
2000
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
ENTCS
2010
13 years 8 months ago
2010
It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towar...