@inproceedings{456d7bf730554417966585c5a12f604f,
title = "Call-by-value λ-graph rewriting without rewriting",
abstract = "Girard{\textquoteright}s Geometry of Interaction offers a low-level decomposition of the cut-elimination process in linear logic, which can be used as a compilation technique for functional programming languages. It is the basis of the Geometry of Interaction Machine, which performs call-by-name computations in graph representations of functional programs without doing any graph reduction. Computation is given by a graph traversal algorithm: a simple intuition is that of a single token traveling through a fixed graph (the program to be evaluated), unraveling the evaluation. Here we continue this line of research to derive alternative ways of following this execution path which give call-by-value computations.",
author = "Maribel Fern{\'a}ndez and Ian Mackie",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 1st International Conference on Graph Transformation, ICGT 2002 ; Conference date: 07-10-2002 Through 12-10-2002",
year = "2002",
month = jan,
day = "1",
doi = "10.1007/3-540-45832-8\_8",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "75--89",
editor = "Andrea Corradini and Hartmut Ehrig and Hans-J{\"o}rg Kreowski and Grzegorz Rozenberg",
booktitle = "Graph Transformation - 1st International Conference, ICGT 2002, Proceedings",
}