251 search results - page 22 / 51 » Pure Type Systems without Explicit Contexts |
COMPSAC
2007
IEEE
14 years 2 months ago
2007
IEEE
In a component-based system components are basic computation units implementing specific business functions, and their interactions are explicitly represented by connectors. If th...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
IJCNLP
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes a chunking strategy to detect unknown words in Chinese word segmentation. First, a raw sentence is pre-segmented into a sequence of word atoms 1 using a maximum...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
ILP
2005
Springer
14 years 1 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...