On graph rewriting, reduction, and evaluation in the presence of cycles
From MaRDI portal
(Redirected from Publication:526460)
Recommendations
Cites work
- scientific article; zbMATH DE number 108369 (Why is no real title available?)
- scientific article; zbMATH DE number 1086663 (Why is no real title available?)
- scientific article; zbMATH DE number 1142317 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- A Rational Deconstruction of Landin's SECD Machine with the J Operator
- A linear space translation of functional programs to Turner combinators
- A new implementation technique for applicative languages
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Combinatory logic. Vol. II
- Comparing parallel functional languages: Programming and performance
- From reduction-based to reduction-free normalization
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
- Inter-deriving semantic artifacts for object-oriented programming
- Lightweight fusion by fixed point promotion
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
- On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
- Properties of a first-order functional language with sharing
- Refunctionalization at work
- Semantics and algebraic specification. Essays dedicated to Peter D. Mosses on the occasion of his 60th birthday
- Semantics engineering with PLT Redex
- The Mechanical Evaluation of Expressions
- The Zipper
- Three Syntactic Theories for Combinatory Graph Reduction
Cited in
(3)
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)
