Sciweavers

3658 search results - page 54 / 732
» The logic of proofs, semantically
Sort
View
ESOP
2009
Springer
14 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
CADE
2005
Springer
14 years 9 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
CADE
2002
Springer
14 years 9 months ago
Formal Verification of a Java Compiler in Isabelle
This paper reports on the formal proof of correctness of a compiler from a substantial subset of Java source language to Java bytecode in the proof environment Isabelle. This work ...
Martin Strecker
ICFP
2002
ACM
14 years 9 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
14 years 3 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston