Citation Context

...ferences [12], that of Reddy and Yang on a parametric model for a divergencefree, Pascal-like language with heap-allocated references [14] and that of Shinwell and Pitts on an FM-cpo model of FreshML =-=[17]-=-. Section 2 introduces MILler, a monadic, monomorphic, ML-like language with references storing integers or the addresses of other references. Section 3 defines a computationally adequate denotational...

Citation Context

...d for typeincorrect expressions, such as the addition of two locations. The only nonstandard part is the semantics of the command type com, which we define in the continuation passing style following =-=[19, 4]-=-: O def = {normal, err}⊥ (with π · o = o) Heap def = Loc ⇀fin Val × Val Cont def = (Heap → O) [com] def = (Heap × Cont → O). 9sVal def = Loc + Int + {default} O def Heap def = Loc ⇀fin Val × Val Cont ...

Citation Context

...es that they contain, and on a conservative, automatic decision procedure for this logic. It is argued that Pure FreshML can express non-trivial syntax-manipulating algorithms. 1 Introduction FreshML =-=[23, 22]-=- extends ML with constructs for declaring and manipulating abstract syntax trees that involve names and statically scoped binders. FreshML aims to be a better meta-programming language than ML by allo...

Citation Context

...computations that intuitively behave in the same way but allocate cells in different order may not be equated by the model. We believe that the model can be refined by ”susing realizers in FM-domains =-=[25, 24, 3]-=-, such that support would then be up to a permutation of the locations in the heap. (Indeed, FM-domains have already been applied in a recent parametric model for separation logic [9].) We leave this ...

Citation Context

... example, it does not disturb function extensionality) and is in a sense more general than dynamic allocation, because the latter can be encoded in it via a continuation monad; cf. Shinwell and Pitts =-=[32]-=-. The conversions in Fig. 3 for (...

Citation Context

...e in [17], and should be simplified thanks to the use of set-theoretic language (most of the time). Note that no notion of forcing is required. Nominal sets have been generalised to ‘nominal domains’ =-=[22]-=- thus giving access to fresh names in denotational semantics. It would be interesting to generalise renaming sets in this way as well, giving access to fresh names with substitution within a functiona...