LPAR
2010
Springer
13 years 9 months ago
2010
Springer
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. A meta-program is a program that generates or manipulates another program; in homogeneous meta-programming, a program may generate new parts of, or manipulate, itself. Me...
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
In the celebrated G
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...