Sciweavers

142 search results - page 16 / 29
» Proving Termination by Invariance Relations
Sort
View
95
Voted
ECOOP
2006
Springer
15 years 1 months ago
Variance and Generalized Constraints for C# Generics
Abstract. Generic types in C behave invariantly with respect to subtyping. We propose a system of type-safe variance for C that supports the declaration of covariant and contravari...
Burak Emir, Andrew Kennedy, Claudio V. Russo, Dach...
TIT
2002
91views more  TIT 2002»
14 years 9 months ago
Hidden Markov processes
An overview of statistical and information-theoretic aspects of hidden Markov processes (HMPs) is presented. An HMP is a discrete-time finite-state homogeneous Markov chain observe...
Yariv Ephraim, Neri Merhav
92
Voted
IJCAI
2003
14 years 11 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
ICALP
2010
Springer
14 years 10 months ago
What Is a Pure Functional?
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
LICS
2000
IEEE
15 years 2 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki