Open Access
Programming an Interpreter Using Molecular Dynamics
Jan A. Bergstra,Cornelis A. Middelburg +1 more
- 01 Jan 2007
- Vol. 17, pp 47-81
TL;DR: In this article, the authors consider the programming of an interpreter for a program notation that is close to existing assembly languages using PGA with the primitives of molecular dynamics as basic instructions.
read more
Abstract: PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation developed in the setting of \PGA, which bears on the use of dynamic data structures in programming. We consider the programming of an interpreter for a program notation that is close to existing assembly languages using PGA with the primitives of molecular dynamics as basic instructions. It happens that, although primarily meant for explaining programming language features relating to the use of dynamic data structures, the collection of primitives of molecular dynamics in itself is suited to our programming wants.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Instruction Sequences with Dynamically Instantiated Instructions
TL;DR: In this article, the authors study sequential programs that are instruction sequences with dynamically instantiated instructions and define the meaning of such programs in two different ways, and give a translation by which each program with dynamically-instantiated instructions is turned into a program without them that exhibits on execution the same behaviour by interaction with some service.
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting
TL;DR: This work presents a simple model of computation in which states of computations are modelled as data linkages and state changes take place by means of certain actions.
Bitcoin: not a currency-like informational commodity
Jan A. Bergstra
- 01 Oct 2014
TL;DR: In this article, the status of Bitcoin is discussed from a perspective of organizational multi-threading, and six assertions concerning Bitcoin's status are formulated and defended: (i) Bitcoin is not and will not become a currency-like informational commodity, (ii) currencylike informational commodities that aren't currencies must be frauds, (iii) specific BTC amounts may become monetized and thus may be turned into financial assets, (iv) currently no BTC amounts are monetized in any currency area and therefore none are financial assets.
Bitcoin: a Money-like Informational Commodity
Jan A. Bergstra,Peter Weijland +1 more
- 06 Feb 2014
TL;DR: In this paper, the authors classify Bitcoin as a system of type money-like informational commodity (MLIC) and propose a top-level classification, or type, for Bitcoin.
Data linkage algebra, data linkage dynamics, and priority rewriting
TL;DR: In this paper, an algebra of data linkages is introduced for modeling the states of computations in which dynamic data structures are involved, and state changes take place by means of certain actions.
5
References
•Book
Molecular Dynamics
William G. Hoover
- 05 Oct 2014
TL;DR: The equations of motion are solved numerically to follow the time evolution of the system, allowing the derivation of kinetic and thermodynamic properties of interest by means of ‘computer experiments’.
771
Introduction to process algebra
Wan Fokkink
- 01 Jan 2000
TL;DR: The theory of process algebra has developed rapidly over the last twenty years, and verification tools have been developed on the basis of the process algebra, often in cooperation with techniques related to model checking.
391
The programming language Pascal
Niklaus Wirth
- 01 Jan 2002
TL;DR: Pascal as mentioned in this paper is a programming language based on ALGOL 60 which was developed to teach programming and as an efficient tool to write large programs, emphasis was placed on keeping the number of fundamental concepts reasonably small, on a simple and systematic language structure, and on efficient implementability.
Division Safe Calculation in Totalised Fields
Jan A. Bergstra,John V. Tucker +1 more
TL;DR: In this paper, three methods of guaranteeing division safe calculations in 0-totalised fields are proposed, where division is defined as a total operation with 0−1=0, where 0 is the number of operations in the total operation.
Decision Problems for Pushdown Threads
Jan A. Bergstra,Inge Bethke,Alban Ponse +2 more
- 01 Jan 2005
TL;DR: In this article, the equivalence of pushdown threads is shown decidable whereas pushdown thread inclusion is undecidable, which is an example of a borderline crossing where equivalence problem is decidable, whereas the inclusion problem is not.
52