claim

active

claim: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

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.

Claim that hardware-supported associative lookup would enable high-performance dynamic language runtimes.

Source paper

extracted_from

An association-based model of dynamic behaviour

(2011) · Piumarta, Ian

Neighborhood — ranked by edge-count

Papers (1)

paper

An association-based model of dynamic behaviour
supports

Claims (1)

claim

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.
extends
The central thesis of the paper, that associative lookup is a universal building block for dynamic system semantics.

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

"We may never see hardware support for the primitive operators described here, but an efficient software implementation (capable of scaling to billions of entries) would make a great doctoral thesis."concept0.851
Acknowledges practical barriers to realizing the framework while identifying the central implementation challenge: efficient scaling in software.
When a problem has a simple solution, a useful system will give programmers access to the simple solution; Parlog forces complex solutions to simple problems.claim0.790
Critique that Parlog's abstraction level is too high and restrictive.
An efficient software implementation (capable of scaling to billions of entries) would make a great doctoral thesis.claim0.782
Claim that building a scalable associative memory engine is a significant research challenge.
Independently of any possibility for hardware support, the association primitive is useful to understand the semantics and complexity of a particular application mechanism and to compare and contrast different mechanisms.claim0.782
Claim that the model has value as a semantic analysis tool even without performance gains.
Efficient hardware support for large n-dimensional associative memory would enable implementations of diverse object models.finding0.780
A computer program is not defined by its language or hardware but as an abstract causal pattern, a dynamic mathematical structure that influences the physical universe without violating its causal closure.claim0.780
Paper's ontological characterization of software enabling cyberanimism
This suggests using the association primitive as part of a language definition, to be translated automatically into an efficient implementation.claim0.777
Claim that the primitive could serve as a high-level specification from which efficient code is generated.
Small, well-designed core (storage, file, display, text, viewers, loader, drivers) enables powerful extensibility.finding0.776