A visual model of computation

Authors:
Ian Mackie
Affiliations:
LIX, CNRS UMR 7161, École Polytechnique, Palaiseau Cedex, France
Venue:
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Year:
2010

Citing 6
Cited 2

Linear logic

Theoretical Computer Science
Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Rewrite systems

Handbook of theoretical computer science (vol. B)
The geometry of optimal lambda reduction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Interaction nets and term-rewriting systems

Theoretical Computer Science - Special issue: trees in algebra and programming

Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Realizing monads in interaction nets via generic typed rules

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many new models of computation have emerged over the last years to meet the demands of modelling new features or new concepts in programming languages Rarely do we find a model that becomes a programming paradigm The aim of this paper is to show how a fine-grained model of computation can be used directly as a programming language Moreover, the model can also exhibit visually properties of algorithms, such as space and time usage.