Worlds: Controlling the Scope of Side Effects

Warth, Alessandro; Ohshima, Yoshiki; Kaehler, Ted; Kay, Alan

doi:10.1007/978-3-642-22655-7_9

Cited by 16 publications

(12 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scoping side-effects has been the focus of two recents works. Worlds [30] provide a way to control and scope side-effects in Javascript. Tanter proposed a more flexible scheme: contextual values [31] are scoped by a very general context function.…”

Section: Related Workmentioning

confidence: 99%

Read-Only Execution for Dynamic Languages

Arnaud

Denker

Ducasse

et al. 2010

Objects, Models, Components, Patterns

View full text Add to dashboard Cite

Abstract. Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically typed languages is difficult to achieve because of the absence of a type checking phase and the support of an open-world assumption in which code can be constantly added and modified. To address this issue, we propose Dynamic Read-Only references (DRO) that provide a view on an object where this object and its object graph are protected from modification. The readonly view dynamically propagates to aggregated objects, without changing the object graph itself; it acts as a read-only view of complex data structures, without making them read-only globally. We implement dynamic read-only references by using smart object proxies that lazily propagate the read-only view, following the object graph and driven by control flow and applied them to realize side-effect free assertions.

show abstract

Section: Related Workmentioning

confidence: 99%

Read-Only Execution for Dynamic Languages

Arnaud

Denker

Ducasse

et al. 2010

Objects, Models, Components, Patterns

View full text Add to dashboard Cite

show abstract

“…As pointed out in [6], one way to choose the meaning of successive axes results in a progression from object-oriented to subject-oriented to context-oriented programming. Similarly, Worlds [13] is a simple addition of an axis to an existing association/aggregation mechanism. We could continue to invent new and exciting mechanisms beyond context-orientation and Worlds, ad absurdum, or recognise they are all just points within a dimensionally unbounded space of related, self-similar mechanisms.…”

Section: Discussionmentioning

confidence: 99%

An association-based model of dynamic behaviour

Piumarta

2011

Proceedings of the 1st International Workshop on Free Composition

View full text Add to dashboard Cite

Dynamic programming languages seem to spend much of their time looking up behaviour associatively. Data structures in these languages are also easily expressible as associations. We propose that many, and maybe even all, interesting organisations of information and behaviour might be built from a single primitive operation: n-way associative lookup. A fast implementation of this primitive, possibly in hardware, could be the basis of efficient and compact implementations of a diverse range of programming language semantics and data structures.

show abstract

“…Another work in change management system is Worlds ( [36]). It is a language construct which reifies the notion of program state.…”

Section: Change-based Environmentmentioning

confidence: 99%

Supporting simultaneous versions for software evolution assessment

Laval¹,

Denier²,

Ducasse³

et al. 2011

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c tWhen reengineering software systems, maintainers should be able to assess and compare multiple change scenarios for a given goal, so as to choose the most pertinent one. Because they implicitly consider one single working copy, revision control systems do not scale up well to perform simultaneous analyses of multiple versions of systems. We designed Orion, an interactive prototyping tool for reengineering, to simulate changes and compare their impact on multiple versions of software source code models. Our approach offers an interactive simulation of changes, reuses existing assessment tools, and has the ability to hold multiple and branching versions simultaneously in memory. Specifically, we devise an infrastructure which optimizes memory usage of multiple versions for large models. This infrastructure uses an extension of the FAMIX source code meta-model but it is not limited to source code analysis tools since it can be applied to models in general. In this paper, we validate our approach by running benchmarks on memory usage and computation time of model queries on large models. Our benchmarks show that the Orion approach scales up well in terms of memory usage, while the current implementation could be optimized to lower its computation time. We also report on two large case studies on which we applied Orion.

show abstract

Worlds: Controlling the Scope of Side Effects

Cited by 16 publications

References 16 publications

Read-Only Execution for Dynamic Languages

Read-Only Execution for Dynamic Languages

An association-based model of dynamic behaviour

Supporting simultaneous versions for software evolution assessment

Contact Info

Product

Resources

About