999 search results - page 51 / 200 » On the Decidability of Functional Uncertainty |
POPL
1997
ACM
14 years 27 days 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...
JUCS
2002
13 years 8 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...
FORMATS
2009
Springer
14 years 3 months 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...
JACM
2002
13 years 8 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, ...
FOSSACS
2005
Springer
14 years 2 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...