64 search results - page 11 / 13 » Proving Church's Thesis |
CADE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
ISIPTA
2005
IEEE
15 years 3 months ago
2005
IEEE
A Chaotic Probability model is a usual set of probability measures, M, the totality of which is endowed with an objective, frequentist interpretation as opposed to being viewed as...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
GG
2004
Springer
15 years 2 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
TYPES
1998
Springer
15 years 1 months ago
1998
Springer
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...