On the convergence of reduction-based and model-based methods in proof theory
Preprint in arXiv (May 2023)
The most recent citing publication is shown below. View this citation on Dimensions.
Rewriting, Computation and Proof
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 The Hydra Battle Revisited
-
Altmetric BadgeChapter 2 Orderings and Constraints: Theory and Practice of Proving Termination
-
Altmetric BadgeChapter 3 Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
-
Altmetric BadgeChapter 4 Computability Closure: Ten Years Later
-
Altmetric BadgeChapter 5 Reduction Strategies and Acyclicity
-
Altmetric BadgeChapter 6 Towards Rewriting in Coq
-
Altmetric BadgeChapter 7 Superdeduction at Work
-
Altmetric BadgeChapter 8 Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ -Calculus
-
Altmetric BadgeChapter 9 Linear Recursive Functions
-
Altmetric BadgeChapter 10 Deducibility Constraints, Equational Theory and Electronic Money
-
Altmetric BadgeChapter 11 Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
-
Altmetric BadgeChapter 12 Towards Modular Algebraic Specifications for Pointer Programs: A Case Study
-
Altmetric BadgeChapter 13 Modeling Permutations in Coq for Coccinelle
Attention for Chapter 8:
Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ -Calculus