921 search results - page 77 / 185 » Expressing Computational Complexity in Constructive Type The... |
SLIP
2003
ACM
14 years 1 months ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
APAL
2006
13 years 8 months ago
2006
We introduce the notion of infinitary preorder and use it to obtain a predicative presentation of sup-lattices by generators and relations. The method is uniform in that it extend...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
AAAI
2010
13 years 9 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...