55 search results - page 8 / 11 » Inductive Consequences in the Calculus of Constructions |
CORR
2000
Springer
13 years 7 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
TAPSOFT
1993
Springer
13 years 12 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...