13383 search results - page 22 / 2677 » Abstractions from proofs |
CIE
2010
Springer
14 years 2 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
SLP
1993
13 years 11 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
DBSEC
2003
13 years 11 months ago
2003
Abstract Data integrity can be problematic when integrating and organizing information from many sources. In this paper we describe efficient mechanisms that enable a group of data...
DLT
2008
13 years 11 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
DCG
2010
13 years 7 months ago
2010
Abstract. The Topological Radon Theorem states that, for every continuous function from the boundary of a (d + 1)-dimensional simplex into Rn , there exist a pair of disjoint faces...