Sciweavers

2152 search results - page 13 / 431
» On Automating the Calculus of Relations
Sort
View
CADE
2006
Springer
14 years 7 months ago
Automating Proofs in Category Theory
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
Dexter Kozen, Christoph Kreitz, Eva Richter
MFCS
2000
Springer
13 years 11 months ago
Explicit Fusions
We introduce explicit fusions of names. To `fuse' two names is to declare that they may be used interchangeably. An explicit fusion is one that can exist in parallel with som...
Philippa Gardner, Lucian Wischik
CADE
2007
Springer
14 years 7 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
RTA
2005
Springer
14 years 26 days ago
Call-by-Value Is Dual to Call-by-Name - Reloaded
We consider the relation of the dual calculus of Wadler (2003) to the λµ-calculus of Parigot (1992). We give translations from the λµ-calculus into the dual calculus and back a...
Philip Wadler
ICLP
2010
Springer
13 years 11 months ago
Focused Proof Search for Linear Logic in the Calculus of Structures
The proof-theoretic approach to logic programming has benefited from the
Nicolas Guenot