Y. Motohama, The call-by-value type discipline over the minimal relevant logic B+, manuscript (1997). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Completeness of Intersection and Union Type Assignment.. - Ishihara, Kurata (1 citation) (Correct)
.... types mentioned above, Dezani [6] pointed out an construction of models of the call by value calculus based on intersection and union type assignment systems, which is a counterpart of the lter model for classical calculus due to Barendregt et al. Then the idea was formalized by Motohama [15] (more detailed explanation is given in [1] and was presented in the MSJ regional workshop on Theories of Types and Proofs held at Tokyo Institute of Technology in 1997. On the other hand, in this paper we shall also introduce two intersection and union type assignment systems TA and TA based ....
Y. Motohama, The call-by-value type discipline over the minimal relevant logic B+, manuscript (1997).
SN Combinators and Partial Combinatory Algebras - Yohji Akama (Correct)
....the values. a) A cpo model Q subject to the domain equation Q [Q Q] Egidi HonsellRonchi [8] b) Logical models , i.e, models associated to intersection type assignment systems to fi v . There are Egidi Honsell Ronchi s intersection type assignment system [8] and Motohoma s system [17]. c) The term model, i.e. the values of fi v (Pino Perez [18] 3. P of Theorem 2. Beeson [2] Bethke Klop [5] Akama [1] An nca is called extensional if (8x: a 0 x a 1 x) implies a 0 = a 1 . It is well known that an nca of Example 3(1) is not extensional. An extensional nca is a model of ....
Yoko Motohama. The call-by-value type discipline over the minimal relevant logic B+, 1997.
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