Ram'on Pino Perez. An extensional partial combinatory algebra based on -terms. In A. Tarlecki, editor, Mathematical foundations of computer science, volume 520 of Lecture Notes in Computer Science, pages 387--396. Springer, 1991.  Home/Search   Document Not in Database   Summary   Related Articles

....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 Moggi s partial calculus which was introduced to reason about ....

....R (Bethke [4] A modification of Plotkin Scott Engeler s graph model, which has [R R] as a retract. Although the nca of Example 3(2a) is subject to a similar domain equation, it is not extensional [8, Lemma20] 2. Pca s modulo an applicative bisimulation (Egidi Honsell Ronchi [8] Pino Perez [18]) or modulo an observational equivalence (Bethke Klop [5] See Theorem 9, for it. In Subsection 3.2, we will construct another extensional nca F which is elementary but useful. Remark 5. P yields models of calculi by which we can prove normalization properties of the calculi. 1. Sn of ....

Ram'on Pino Perez. An extensional partial combinatory algebra based on -terms. In A. Tarlecki, editor, Mathematical foundations of computer science, volume 520 of Lecture Notes in Computer Science, pages 387--396. Springer, 1991.

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