3552 search results - page 138 / 711 » Proof theory in the abstract |
190
click to vote
CCA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract Stone Duality is a revolutionary theory that works directly with computable continuous functions, without using set theory, infinitary lattice theory or a prior theory o...
296
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
185
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
266
click to vote
TOPLAS
2008
15 years 6 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
180
click to vote
AI
2007
Springer
15 years 6 months ago
2007
Springer
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...