Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
In this paper,a we present sample performance figures for a new linear algebra-based compilation framework implemented in a research HPF compiler called PARADIGM. The metrics cons...
A declarative rule inference engine can be very useful for modern distributed or heterogeneous applications, if it can be configured for multiple semantics and evaluation strategi...
Current software development techniques and tools lack the capability to characterize function call chains in multithreaded and distributed applications built upon component techn...
Telepresent Agents are software Agents that are instantiated simultaneously within two or more distinct computer applications (called Locales) which are operating at distinct nodes...