Sciweavers

42 search results - page 6 / 9
» Normal Form Theorem Proving for the Lambek Calculus
Sort
View
SYNTHESE
2008
88views more  SYNTHESE 2008»
13 years 7 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui
CADE
1994
Springer
13 years 11 months ago
Pi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...
Lars-Henrik Eriksson
TYPES
1998
Springer
13 years 11 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner
PPOPP
2010
ACM
14 years 4 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg