999 search results - page 51 / 200 » On the Decidability of Functional Uncertainty |
165
click to vote
POPL
1997
ACM
15 years 10 months ago
1997
ACM
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
166
click to vote
JUCS
2002
15 years 5 months ago
2002
: When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another wor...
151
click to vote
FORMATS
2009
Springer
16 years 13 days ago
2009
Springer
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
161
click to vote
JACM
2002
15 years 5 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
166
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...