922 search results - page 108 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
226
click to vote
NETWORKS
2011
14 years 9 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
200
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
185
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
162
click to vote
LPNMR
1997
Springer
15 years 10 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
209
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...