On graph rewriting, reduction, and evaluation in the presence of cycles

DOI10.1007/S10990-014-9103-9zbMATH Open1425.68175OpenAlexW2038249060MaRDI QIDQ526460FDOQ526460

Authors: Ian Zerny 

Publication date: 15 May 2017

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-014-9103-9

Recommendations

• On term-graph rewrite strategies
• scientific article; zbMATH DE number 1231494
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• scientific article; zbMATH DE number 177461
• scientific article; zbMATH DE number 124283

zbMATH Keywords

refocusingcontinuation-passing styledefunctionalizationgraph reductionreduction machineterm-graph rewriting

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Combinatory logic. Vol. II
• The Zipper
• The Mechanical Evaluation of Expressions
• Three Syntactic Theories for Combinatory Graph Reduction
• Lightweight fusion by fixed point promotion
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• From reduction-based to reduction-free normalization
• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
• A syntactic correspondence between context-sensitive calculi and abstract machines
• Refunctionalization at work
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• Comparing parallel functional languages: Programming and performance
• A linear space translation of functional programs to Turner combinators
• A Rational Deconstruction of Landin's SECD Machine with the J Operator
• Semantics engineering with PLT Redex
• Title not available (Why is that?)
• A new implementation technique for applicative languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Properties of a first-order functional language with sharing
• Semantics and algebraic specification. Essays dedicated to Peter D. Mosses on the occasion of his 60th birthday
• Inter-deriving semantic artifacts for object-oriented programming

Cited In (3)

• On the graph traversal method for evaluating linear binary-chain programs
• Three syntactic theories for combinatory graph reduction
• Title not available (Why is that?)

Uses Software

• Coq
• ML
• DACTL
• PLT Redex

This page was built for publication: On graph rewriting, reduction, and evaluation in the presence of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526460)