Viktor Kuncak and Martin Rinard. Structural subtyping of non-recursive types is decidable. In Eighteenth Annual IEEE Symposium on Logic in Computer Science, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Extension of HM(X) with Bounded Existential and Universal.. - Simonet (Correct)
....algorithms are known for solving and simplifying constraints [FM89, Tiu92, HM95, Sim03c] However, the type inference algorithm of section 4 produces a non standard form of constraints, #.D =# C, which combines universal quantification with implication. On the one hand, Kuncak and Rinard [KR03] recently showed that the first order theory of structural subtyping of non recursive types is decidable; however, this study does not yield a practical algorithm for solving constraints. On the other hand, previous works [HR97, Sim03c] described e#cient algorithms for deciding top level ....
Viktor Kuncak and Martin Rinard. Structural subtyping of non-recursive types is decidable. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science, June 2003.
An extension of HM(X) with first class existential and universal.. - Simonet (Correct)
....algorithms are known for solving and simplifying constraints [FM89, Tiu92, HM95, Sim03] However, the type inference algorithm for HM98 (X) produces a non standard form of constraints, 8 :D Z) C, which combines universal quanti cation with implication. On the one hand, Kuncak and Rinard [KR03] recently showed that the rst order theory of structural subtyping of non recursive types is decidable; however, this study does not yield a practicable algorithm for solving constraints. On the other hand, previous works [HR97, Sim03] described algorithms for deciding top level implication of ....
Viktor Kuncak and Martin Rinard. Structural subtyping of non-recursive types is decidable. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science, June 2003.
An extension of HM(X) with first class existential and universal.. - Simonet (Correct)
.... M) 9 [D] L hvi : M = 9 : 8 :D Z) L v : M ( 8 [D] L open e : M = 9 : L e : M D ) 8 [D] Figure 4: Type inference for HM98 (X) quanti cation with implication. On the one hand, Kuncak and Rinard [KR03] recently showed that the rst order theory of structural subtyping of non recursive types is decidable; however, this study does not yield a practicable algorithm for solving constraints. On the other hand, previous works [HR97, Sim03b] described algorithms for deciding top level implication of ....
Viktor Kuncak and Martin Rinard. Structural subtyping of non-recursive types is decidable. In 18th IEEE Symposium on Logic in Computer Science, 2003.
On Relational Analysis of Algebraic Datatypes - Kuncak, Jackson Self-citation (Kuncak) (Correct)
No context found.
Viktor Kuncak and Martin Rinard. Structural subtyping of non-recursive types is decidable. In Eighteenth Annual IEEE Symposium on Logic in Computer Science, 2003.
Term Algebras with Length Function and Bounded Quantifier.. - Zhang, Sipma, Manna (2004) (Correct)
No context found.
Viktor Kuncak and Martin Rinard. The structural subtyping of non-recursive types is decidable. In Proceedings of 18th IEEE Symposium on Logic in Computer Science, pages 96--107. IEEE Computer Society Press, 2003.
Term Algebras with Length Function and Bounded Quantifier.. - Zhang, Sipma, Manna (Correct)
No context found.
Viktor Kuncak and Martin Rinard. The structural subtyping of non-recursive types is decidable. In Proc. 18th IEEE Symp. Logic in Comp. Sci., pages 96--107. IEEE Computer Society Press, 2003.
Subtype Constraints in Modal Logic - Niehren, Priesnitz (2005) (Correct)
No context found.
V. Kuncak and M. Rinard. Structural subtyping of non-recursive types is decidable. In LICS, pages 96--107, 2003.
Constraint-Based Type Inference for Guarded Algebraic Data Types - Simonet, Pottier (2003) (1 citation) (Correct)
No context found.
Viktor Kuncak and Martin Rinard. Structural subtyping of non-recursive types is decidable. In IEEE Symposium on Logic in Computer Science (LICS), June 2003.
Type Inference with Structural Subtyping: A faithful.. - Simonet (2003) (3 citations) (Correct)
No context found.
Kuncak, V., Rinard, M.: Structural subtyping of non-recursive types is decidable. In: 18th IEEE Symposium on Logic in Computer Science. (2003)
Type Inference With Structural Subtyping: - Faithful Formalization Of (Correct)
No context found.
Viktor Kuncak and Martin Rinard. Structural subtyping of non-recursive types is decidable. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science, June 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC