5084 search results - page 264 / 1017 » Proving Possibility Properties |
121
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
178
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the authorās knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
177
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
We study the empire colouring problem (as deļ¬ned by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
180
click to vote
TPHOL
2007
IEEE
16 years 26 days ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
139
click to vote
TPHOL
2007
IEEE
16 years 26 days ago
2007
IEEE
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed Ī»-calculus is exactly the simply typed fragment of th...