318 search results - page 43 / 64 » Formal Description of Autopoiesis Based on the Theory of Cat... |
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in t...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
PODS
2011
ACM
12 years 11 months ago
2011
ACM
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...