J. Hannay. Abstraction barrier-observing relational parametricity. Proc. 6th Intl. Conf. on Typed Lambda Calculi and Applications, TLCA 2003, Valencia. Springer LNCS 2701 (2003).  Home/Search   Document Not in Database   Summary   Related Articles

.... of taking a syntactic approach, placing the concept of simulation relation in a logical setting and using existential type quantification for data abstraction [MP88] This line of development has been investigated in a string of papers on abstraction barrierobserving simulation relations by Hannay [Han99,Han00,Han01,Han03] based on a logic for parametric polymorphism due to Plotkin and Abadi [PA93] A clear advantage of such an approach is that it is amenable to computer aided reasoning but there are certain compromises forced by the syntactic nature of the framework. We present this background in Sects. 2 4 and ....

....# g#bs # where s (# s # for k = ###a, b##s, s # : #, y : # . x # y sx # s # y = x : #, y : #) #f # : #]## . f# #as = x f# #bs # = y) In general, Dfnbl clauses are inserted recursively in arrow types, bottoming out at base relations. The notion of abo relation in [Han03] formalises the idea. Universal types play two roles. Consider (##.##(###)#(##. ###)##)##) and a term of this type, e.g. ##.#x : #, s : ###, p : ##. ###)## . s(p#s) The abo relation treats the outer universal type as the type of a computation, and sets up the Dfnbl clauses according to ....

[Article contains additional citation context not shown here]

J. Hannay. Abstraction barrier-observing relational parametricity. Proc. 6th Intl. Conf. on Typed Lambda Calculi and Applications, TLCA 2003, Valencia. Springer LNCS 2701 (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