G. D. Plotkin. Types and partial functions, 1985. PostGraduate Lecture Notes, Dept. of Computer Science, University of Edinburgh.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in question, the denotational model has to fit well with the operational behaviour of programs. Adequacy establishes just such a goodness of fit criterion which is of fundamental importance. Plotkin s adequacy result for pcf has been extended to richer computational settings. For example, in [ Plotkin, 1985 ] it is shown that adequacy holds for a meta language for denotational semantics which has an elaborate type system including recursive types. An interesting line of research is to prove adequacy for as general a computational setting as possible. A related problem is the investigation of proof ....

G. D. Plotkin. Types and partial functions, 1985. PostGraduate Lecture Notes, Dept. of Computer Science, University of Edinburgh.

....variation of the theme called logical relation was independently developed by Plotkin [20] see also [28] Logical relations are a very useful tool for proving properties of typed lambda calculi. Plotkin s adequacy result for PCF has been extended to richer computational settings. For example, in [25], it is shown that adequacy holds for a meta language for denotational semantics which has an elaborate type system including recursive types. An interesting line of research is to prove adequacy for as general a computational setting as possible. A related problem is the investigation of proof ....

G. D. Plotkin. Types and partial functions. Post-Graduate Lecture Notes, Dept. of Computer Science, University of Edinburgh, 1985.

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