K. Mulmuley. Fully abstract submodels of typed lambda calculus. Journal of Computer and System Sciences, 33:2--46, 1986. 354 C.-H. L. Ong Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Correspondence between operational and denotational semantics: the.. - Ong (1995) (16 citations) (Correct)
....some parallel algorithms (like parallel or ) which are not pcf definable have denotations as continuous functions. So the continuous function space model fails to characterize higher type sequentiality in the pcf sense because it is too large . Next, consider the construction of Mulmuley [ Mulmuley, 1986 ] which achieved a fully abstract characterization of pcf by a syntax based quotienting operation that cuts the somewhat non standard (base types are interpreted as flat lattices as opposed to flat cpos) continuous function space model down to size. Such an approach, in our view, falls short of ....
....model for a combinatory logic version of pcf. His model is essentially a term model; the construction was based on suitable completions of sets of equivalence classes of terms in a way which is reminiscent of the construction of sfp domains (see [ Plotkin, 1976 ] A restrictive approach In [ Mulmuley, 1986; Mulmuley, 1987 ] Mulmuley gave a construction of the unique fully abstract model (as identified by Milner) by a mixture of semantic and syntactic means. His starting point was the Scott continuous functions space model built up from the standard lattice interpretation of the numerals and ....
K. Mulmuley. Fully abstract submodels of typed lambda calculus. Journal of Computer and System Sciences, 33:2--46, 1986. 354 C.-H. L. Ong
Correspondence between Operational and Denotational Semantics - Ong (1995) (16 citations) (Correct)
....model of PCF. Milner s model is essentially a term model. The construction uses a suitable completion of terms quotiented by an appropriate equivalence relation in a way which is reminiscent of the construction of SFP domains (see [22] 8. 5 A restrictive approach to full abstraction In [16, 17] Mulmuley gave a construction of Milner s model by a mixture of semantic and syntactic methods. His starting point was the continuous functon space model built up from the standard lattice interpretation of the numerals and booleans. First a family of logical relations d E s indexed by types is ....
K. Mulmuley. Fully abstract submodels of typed lambda calculus. Journal of Computer and System Sciences, 33:2--46, 1986.
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