| D. Aspinall and A. Compagnoni. Subtyping dependent types. Theoretical Computer Science, 266(1-2), 2001. |
No context found.
D. Aspinall and A. Compagnoni. Subtyping dependent types. Theoretical Computer Science, 266(1-2), 2001.
....that messages of type T can be used in place of a message of type T . The environment E tracks the names in scope, and sometimes is omitted in informal discussion. The interaction of subtyping and dependent types can be quite subtle; our treatment is based on that of Aspinall and Compagnoni [AC01], although our setting is much simpler, due to the absence of higher order types. A type s relationship to the type Un of data known to the opponent determines whether it can be sent to or received from the opponent. Let a type T be public if and only if T : Un. Let a type T be tainted if and ....
D. Aspinall and A. Compagnoni. Subtyping dependent types. Theoretical Computer Science, 266(1--2):273--309, 2001.
....that messages of type T can be used in place of a message of type T # . The environment E tracks the names in scope, and sometimes is omitted in informal discussion. The interaction of subtyping and dependent types can be quite subtle; our treatment is based on that of Aspinall and Compagnoni [AC01], although our setting is much simpler, due to the absence of higher order types. A type s relationship to the type Un of data known to the opponent determines whether it can be sent to or received from the opponent. Let a type T be public if and only if T : Un. Let a type T be tainted if and ....
D. Aspinall and A. Compagnoni. Subtyping dependent types. Theoretical Computer Science, 266(1--2):273--309, 2001.
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