3552 search results - page 423 / 711 » Proof theory in the abstract |
159
click to vote
MICCAI
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. This paper presents a new algorithm for non-rigid registration between two doubly-connected regions. Our algorithm is based on harmonic analysis and the theory of optimal...
258
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules a...
170
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
144
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
133
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥ 0 be an integer. Suppose that all left special factors of s longe...