182 search results - page 21 / 37 » A Theory of Strict P-completeness |
TLCA
2005
Springer
15 years 3 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
102
click to vote
AC
2000
Springer
15 years 2 months ago
2000
Springer
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
MMB
2010
Springer
14 years 11 months ago
2010
Springer
We consider a finite buffer system where the buffer content moves in a Markov-additive way while it is strictly between the buffer boundaries. Upon reaching the upper boundary of t...
65
Voted
AI
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. The traditional unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can co...