921 search results - page 24 / 185 » Expressing Computational Complexity in Constructive Type The... |
LICS
2003
IEEE
14 years 1 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
LOGCOM
2000
13 years 7 months ago
2000
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
FUN
2010
Springer
14 years 17 days ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...