Sciweavers

76 search results - page 3 / 16
» Subtyping Recursive Games
Sort
View
LICS
2003
IEEE
15 years 5 months ago
Structural Subtyping of Non-Recursive Types is Decidable
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
Viktor Kuncak, Martin C. Rinard
TLCA
1997
Springer
15 years 3 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Michael Brandt, Fritz Henglein
CORR
2004
Springer
100views Education» more  CORR 2004»
14 years 11 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
BMCBI
2010
100views more  BMCBI 2010»
14 years 11 months ago
Using genomic signatures for HIV-1 sub-typing
Background: Human Immunodeficiency Virus type 1 (HIV-1), the causative agent of Acquired Immune Deficiency Syndrome (AIDS), exhibits very high genetic diversity with different var...
Aridaman Pandit, Somdatta Sinha
ICALP
2005
Springer
15 years 5 months ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis