M. P. Fiore, E. Moggi, and D. Sangiorgi. A fullyabstract model for the -calculus (extended abstract) . In Proceedings of LICS'96, pages 4354. IEEE, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....them. Crucial ingredients of the dynamic allocation monad used there are the object of names , given by the inclusion functor I , Set, and the shift functor : Set Set , given by X(n) X(n 1) These ingredients also occur in subsequent work on modelling calculus names in Set [FMS96, Sta96b] and, most relevantly, recent work on modelling variable binding abstract syntax [FPT99, Hof99] where other presheaf categories besides Set are considered. Now, a somewhat overlooked model of the calculus, mentioned in [PiS93b, Examples 4.3] is the full subcategory of Set whose objects ....

Fiore, M. P., Moggi, E. and Sangiorgi, D.: A fully abstract model for the -calculus (extended abstract). In Eleventh Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Washington, DC, 1996, pp. 43-54.

.... not sufficiently abstract to establish these correctness results (roughly speaking, they do not verify the laws (24) and (25) Therefore, beginning with Oles, Reynolds and Moggi, various people have developed and applied dynamic allocation monads in categories of functors valued in # cpos: see [9, 29] for example. Even though the details of Sects 4 and 5 may seem heavy, in fact they are far less so than the functor category approach both conceptually (we are just doing traditional domain theory, but in a slightly different classical set theory) and practically (constructions on FM cpos, ....

M. P. Fiore, E. Moggi, and D. Sangiorgi. A fully abstract model for the #-calculus (extended abstract). In LICS 1996.

....a traditional global state model and parameterize it with respect to store shapes, to account for the allocation and later deallocation of local variables. Stark has also used functor categories to model ML style references [31] and similar ideas have led to denotational models of the calculus [10, 32]. The second, perhaps computationally more compelling, method has been termed Object based semantics by Reddy [26] In this view, commands, procedures and variables are seen as objects or processes which interact with one another during the course of a computation. Milner adopted this approach ....

M. P. Fiore, E. Moggi, and D. Sangiorgi. A fully abstract model for the - calculus. In 11th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1996.

....a traditional global state model and parameterize it with respect to store shapes, to account for the allocation and later deallocation of local variables. Stark has also used functor categories to model ML style references [35] and similar ideas have led to denotational models of the calculus [10, 36]. The second, perhaps computationally more compelling, method has been termed Object based semantics by Reddy [30] In this view, commands, procedures and variables are seen as objects or processes which interact with one another during the course of a computation. Milner adopted this approach ....

M. P. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model for the - calculus (extended abstract). In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science [12], pages 43--54.

....of weak semantics. Of course one could also work in the category of wellfounded sets Set, explaining away non wellfounded sets at the price of some extra coding and replacing identity with isomorphism. Two versions of denotational semantics have been recently defined for the calculus in [17] and [5]. However, these approaches just work for strong semantics, and, as far as we know, no denotational semantics have been defined for the weak case. From this perspective, the final characterization of the weak semantics is particularly interesting. The paper is organized as follows. In Section 2 ....

....branching weak processes. Contrary to what happens in mathematically more constrained semantical settings, we do not need to worry about closedness or compactness of denotations. A more thorough comparison of the final semantics for calculus presented here and the initial semantics presented in [5, 17] is called for, especially with respect to the metalanguage used in representing the language. ....

M.Fiore, E.Moggi, D.Sangiorgi. A fully-abstract model for the -calculus. In LICS'96, IEEE, 1996.

....functors, should be thought of as a category of nondeterministic domains. The framework in [14] is applied to give a denotational semantics to a value passing process language with late semantics. More recently Ian Stark and the authors have been combining these results with those of [13, 6] to produce presheaf models for the calculus with both early and late semantics. It is also possible to give a presheaf semantics to process languages which permit processes to be passed, and not just discrete values or names, though in this case we do not yet have a good understanding of the ....

Fiore, M.P., Moggi, E., and Sangiorgi, D., A Fully-Abstract Model for the -calculus In Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, pages. 43-54. IEEE Computer Society Press, 1996.

....at each finite stage in their least fixed point definitions, will also have equal denotations. But it is known that the coinductive definition of bisimilarity does not in general close at # in this way. By restricting the degree of branching allowed, one can sometime overcome this deficiency [51, 3, 126, 32, 50]. A possible way to systematise the definition of bisimulation and overcome the limitations of traditional domain theory came out of work on models for concurrency. Models for concurrency Many di#erent kinds of models for concurrent distributed computation have been studied. Work such as [141, ....

....with Marcelo Fiore INTRODUCTION 13 and Glynn Winskel [21] that appeared in the proceedings of LICS 98. Chapter 7 tackles the task of providing presheaf models for name passing calculi. Our example is the # calculus [87, 88] The bicategory Prof is indexed with a category of name sets, as in [126, 32, 50]. A model for the late # calculus is given and it is proved that for processes with free names within a certain set s, open map bisimilarity at the fibre over s coincide with late bisimulation, while open map bisimilarity for each substitution of the free names coincide with the largest congruence ....

[Article contains additional citation context not shown here]

Marcelo P. Fiore, Eugenio Moggi, and Davide Sangiorgi. A fully-abstract model for the #-calculus (extended abstract). In LICS '96 [74], pages 43--54.

....them. Crucial ingredients of the dynamic allocation monad used there are the object of names , given by the inclusion functor I , Set, and the shift functor ffi : Set I Set I , given by ffiX(n) X(n 1) These ingredients also occur in the work on modelling calculus names in Set I [6, 38] and the recent work on modelling variable binding abstract syntax [7, 14] where other presheaf categories besides Set I are considered. Now, a somewhat overlooked model of the calculus, mentioned in [33, Examples 4.3] is the full subcategory of Set I whose objects are the pullback ....

M. P. Fiore, E. Moggi, and D. Sangiorgi. A fully abstract model for the -calculus (extended abstract). In 11th Annual Symposium on Logic in Computer Science, pages 43-- 54. IEEE Computer Society Press, Washington, 1996.

....MPW92a, MPW92b] A denotational understanding of mobility is, however, an essential prerequisite for the compositional development of mobile, and consequently object oriented reactive systems. Recently several researchers have studied mobility in a denotational setting; see for example [JJ95, FMS96, Sta96] These denotational approaches are all directed towards the calculus. In this paper we look at mobility from a different angle; our objective is to build a specification formalism for mobile systems based on streams. As usual in the case of natural language concepts, there is some ....

Marcelo Fiore, Eugenio Moggi, and Davide Sangiorgi. A fully-abstract model for the -calculus (extended abstract). In Eleventh Annual Symposium on Logic in Computer Science (LICS) (New Brunswick, New Jersey), pages 43--54. IEEE, Computer Society Press, July 1996.

....and sensibly interpreted. 2 Related work The idea of using functor categories to describe binding of variables and freshness seems to be in the air . In a semantical context it has been around for a while, notably in the theory of idealised Algol [16, 15] and in semantic models of the calculus [18, 6]. The only place in the literature where functor categories have been used explicitly to justify higher order syntax is [10] It is, however, fair to say that the possibility of using functor categories for HOAS is part of the folklore. Indeed, I believe that most if not all of the results to be ....

....use the full topos logic, but the interpretation of lam obtained as the composition of the third inductive constructor corresponding to T 0 with the map ff would not be injective. Axiom EXT would then be valid with conclusion lam(p) lam(q) rather than p = q. This is basically the approach of [18, 6] except that domain valued functors are used there. In fact, in these papers the subcategory Sh : I)of b Icon sisting of pullback preserving functors only is used. This category forms again a topos and it validates full classical logic, i.e. 8p: Prop:p :p. One has again a finite limit ....

M. Fiore, E. Moggi, and D. Sangiorgi. A fully abstract model for the -calculus. In Proc. 11th Symp. Logic in Comp. Sci. (LICS), New Brunswick, N. J., pages 43-- 55. IEEE, 1996.

No context found.

M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model for the #-calculus. In Proc. 11 LICS Conf., pages 43--54. IEEE, Computer Society Press, 1996. (Full version to appear in Information and Computation).

No context found.

M. P. Fiore, E. Moggi, and D. Sangiorgi. A fullyabstract model for the -calculus (extended abstract) . In Proceedings of LICS'96, pages 4354. IEEE, 1996.

No context found.

M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model for the #-calculus. In Proc. 11th LICS. IEEE Computer Society Press, 1996. 18

No context found.

M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model for the -calculus. In Proc. LICS'96. IEEE, Computer Society Press, 1996.

No context found.

M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model for the #-calculus. In Proc. 11th LICS. IEEE Computer Society Press, 1996.

No context found.

M. P. Fiore, E. Moggi, and D. Sangiorgi. A fully abstract model for the #-calculus (extended abstract). In Eleventh Annual Symposium on Logic in Computer Science, pages 43--54. IEEE Computer Society Press, Washington, 1996.

No context found.

M. Fiore, E. Moggi and D. Sangiorgi. A Fully-Abstract Model for the #-calculus. In Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 43--54. IEEE Computer Society Press, 1996.

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