An association-based model of dynamic behaviour

Piumarta, Ian

doi:10.1145/2068776.2068779

Cited by 2 publications

(4 citation statements)

References 12 publications

(10 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, memory could be virtualized through a page file abstraction. The work in [22] provides a memory virtualization that is closer to Goedel's work in that it introduces associative memory in which data and its association algorithm is encoded as data again 12 , providing powerful tools for accessing this memory. We return to this work in at a later stage.…”

Section: Corollarymentioning

confidence: 99%

“…The hypothesis states that 12 Linear association is commonly used in computing architectures, while simple forms of associative memory exist. The authors in [22] suggest a broad replacement of the simple linear form with more complex associations that are generally connected to the 'purpose' of the information being stored. 13 In practical terms, the modularity of the Turing machine is defined by the particular requirements of the desired service and content delivery being implemented by the Turing machine.…”

Section: Hypothesis 2: Recursively Deconstraining Introduces Flexibilmentioning

confidence: 99%

“…We believe that such line of thought provides appealing connections between novel insights in optimization theory and the understanding of other systems in, e.g., biology, cyberphysical systems as well as neuroscience and the fundamentally theoretical work that Turing provided more 16 See [22] for an example of such algorithmic data interpretation in the OS space, while [28] provides examples of algorithmic encoding of flows in information-centric networking systems.…”

Section: Hypothesis 2: Recursively Deconstraining Introduces Flexibilmentioning

confidence: 99%

See 2 more Smart Citations

Turing, the internet and a theory for architecture

Trossen

2012

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

PREFACEThe late noughties have seen an influx of work in different scientific disciplines, all addressing the question of 'design' and 'architecture'. It is a battle between those advocating the theory of 'emergent properties' and others who strive for a 'theory for architecture'. We provide a particular insight into this battle, represented in the form of a story that focuses on the role of a possibly unusual protagonist and his influence on computer science, the Internet, architecture and beyond. We show his relation to one of the great achievements of system engineering, the Internet, and the possible future as it might unfold.Note from the writer: The tale is placed in a mixture of reality and fiction, while postulating a certain likelihood for this fiction. There is no proof for the assertions made in this tale, leaving the space for a sequel to be told.

show abstract

Section: Corollarymentioning

confidence: 99%

Section: Hypothesis 2: Recursively Deconstraining Introduces Flexibilmentioning

confidence: 99%

Section: Hypothesis 2: Recursively Deconstraining Introduces Flexibilmentioning

confidence: 99%

See 1 more Smart Citation

Turing, the internet and a theory for architecture

Trossen

2012

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

show abstract

“…6 Several unified implementation techniques are discussed in literature, which, however, are limited to modeling a request-reply-style of composition rather than arbitrary control flow composition as presented in this paper. As examples consider the work on predicate dispatching by Ernst et al [8] or on associative lookup by Piumarta [16].…”

Section: Related Workmentioning

confidence: 99%

Reuse of continuation-based control-flow abstractions

Brinke

Bockisch

Bergmans

2011

Proceedings of the 2nd Workshop on Free Composition @ Onward! 2011

View full text Add to dashboard Cite

It is commonly agreed that decomposing a software design according to the structure of the problem domain makes it easier to maintain and manage its complexity (e.g. [9]). To retain the resulting decomposition in the implementation, a programming language is needed that supports composition mechanisms that match the compositions in the problem domain. However, current programming languages only offer a small, fixed set of composition mechanisms. This leads to compromised implementations that either do not follow the decomposition from the design, or are cluttered with additional glue code. In this paper, we discuss the composition of control flow and investigate the hypothesis that continuations may be a suitable atomic core principle for offering a wide range of control-flow composition mechanisms in a form that does not compromise the structure and maintainability of the application. We present four variants of exception handling, which have been implemented using continuations and discuss their differences and commonalities. The results of this comparison are encouraging with respect to the expressiveness of continuations and reusability of implementations. But they also show that current language support for continuations leads to code replication and complex code.

show abstract

An association-based model of dynamic behaviour

Cited by 2 publications

References 12 publications

Turing, the internet and a theory for architecture

Turing, the internet and a theory for architecture

Reuse of continuation-based control-flow abstractions

Contact Info

Product

Resources

About