K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is the extensional collapse of any intensionally fully abstract model. Moreover, note that the collapsing map is a homomorphism, and in particular preserves application. This contrasts sharply with collapses of the standard model to obtain the fully abstract model, as in the work of Mulmuley [Mul87] and Stoughton and Jung [JS93] which are only homomorphic on the inductively reachable subalgebra. Thus we propose that a reasonable factorization of the full abstraction problem is to look for a semantic presentation of an intensionally fully abstract model, which embodies a semantic analysis ....

K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.

....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 booleans. ffl First, ....

K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.

....reasoning about behavior. It has turned out to be surprisingly difficult to give natural (i.e. language independent) constructions of fully abstract semantic models for sequential languages such as PCF [Plo77, BCL85] The known constructions of fully abstract models for PCF [Mil77, Ber78, Mul87] are not natural, yet there are natural fully abstract models for an extension of PCF with parallel facilities [Plo77] and, more recently, with control facilities [CF92, Cur92] There is currently no definition of sequential functions suitable for defining a natural extensional semantic model for ....

K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.

....program by other programs, but runs more slowly than they do, and thus no optimizer should ever produce a program that does not terminate or is in error when the input terminates normally. This non standard notion of program equivalence is related to the concept of observational equivalence (see [11]) To satisfy those who desire more predictability from their compiler, Liar currently provides a switch that turns off the side effect analysis pass by marking everything as potentially side effecting. By using it, the user can prevent Liar from removing procedure calls that may not terminate or ....

Ketan Mulmuley. Full abstraction and semantic equivalence. MIT Press, 1986. ACM Doctoral Dissertation Award, 1986.

....is the extensional collapse of any intensionally fully abstract model. Moreover, note that the collapsing map is a homomorphism, and in particular preserves application. This contrasts sharply with collapses of the standard model to obtain the fully abstract model, as in the work of Mulmuley [13] and Stoughton and Jung [11] which are only homomorphic on the inductively reachable subalgebra. Thus we propose that a reasonable factorization of the full abstraction problem is to look for a semantic presentation of an intensionally fully abstract model, which embodies a semantic analysis of ....

K. Mulmuley, Full Abstraction and Semantic Equivalence, MIT Press 1987.

....is the extensional collapse of any intensionally fully abstract model. Moreover, note that the collapsing map is a homomorphism, and in particular preserves application. This contrasts sharply with collapses of the standard model to obtain the fully abstract model, as in the work of Mulmuley [Mul87] and Stoughton and Jung [AS93] which are only homomorphic on the inductively reachable subalgebra. Thus we propose that a reasonable factorization of the full abstraction problem is to look for a semantic presentation of an intensionally fully abstract model, which embodies a semantic analysis ....

K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.

....(somewhat overlapping) attempts to describe Milner s model: term models, domain theoretic models, sequential algorithms models, games models, and logical relation models. Term models form the first class. Milner s construction was followed by two more distinct constructions. Mulmuley s model [Mul87] takes the original lattice model of Scott and, using syntactic closures (retractions that are greater than the identity) collapses it syntactically to the fully abstract model. The offending parallel elements are sent to the top elements of the lattices, which are then eliminated. Stoughton s ....

K. Mulmuley. Full Abstraction and Semantic Equivalence. The MIT Press, 1987.

....T it has the advantage of having every bounded complete algebraic dcpo as a projection (not just as a retract) There are instances in which a retraction universal domain does not have all of the desired properties so that a projection universal domain is needed. For example Mulmuley [14] requires a projection universal domain to prove some of his results on the existence of inclusive predicates (for showing equivalence of semantics) Table 1 lists some of the known results on universal domains. Posets in the left column are assumed to be countable; their ideal completions are ....

Mulmuley, K., Full Abstraction and Semantic Equivalence. Doctoral Dissertation, Carnegie-Mellon University, 1985, 133 pp.

....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. Full Abstraction and Semantic Equivalence. MIT Press, 1987. REFERENCES 50

....is the extensional collapse of any intensionally fully abstract model. Moreover, note that the collapsing map is a homomorphism, and in particular preserves application. This contrasts sharply with icollapsesj of the standard model to obtain the fully abstract model, as in the work of Mulmuley [21] and Stoughton and Jung [19] which are only homomorphic on the iinductively reachablej subalgebra. Thus we propose that a reasonable factorization of the full abstraction problem is to look for a semantic presentation of an intensionally fully abstract model, which embodies a semantic analysis of ....

K. Mulmuley, Full Abstraction and Semantic Equivalence, MIT Press 1987.

No context found.

K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.

No context found.

Ketan Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, Cambridge, Massachusetts, 1987. Ph. D. Dissertation, Carnegie Mellon University, August 1985.

No context found.

K. Mulmuley, Full abstraction and semantic equivalence (MIT Press, Cambridge Mass., 1987).

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