32 search results - page 3 / 7 » A Proof Dedicated Meta-Language |
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
JSYML
2008
13 years 7 months ago
2008
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
BIRTHDAY
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the...
DSOM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Experiences with the management of Grid specific monitoring and accounting data have shown that current approaches do not sufficiently support a distinction between prov...