232 search results - page 24 / 47 » Reflection principles in computational logic |
TLCA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
GEOINFORMATICA
1998
13 years 9 months ago
1998
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
ICCV
2003
IEEE
15 years 1 hour ago
2003
IEEE
To what extent can three-dimensional shape and radiance be inferred from a collection of images? Can the two be estimated separately while retaining optimality? How should the opt...
TYPES
2004
Springer
14 years 3 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
ICCS
2004
Springer
14 years 3 months ago
2004
Springer
Any non-trivial top-level ontology should take temporal notions into account. The details of how this should be done, however, are frequently debated. In this paper it is argued th...