scientific article; zbMATH DE number 1521621

<a class="pub-badge pub-badge--grey" href="https://zbmath.org/0953.68568" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q4510397" rel="nofollow">MaRDI QID Q4510397</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q4510397" rel="nofollow">FDO</a>

Authors

Publication date 26 October 2000

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(5)

• A functional correspondence between call-by-need evaluators and lazy abstract machines
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
• Median filtering: a new insight
• The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
• Efficient virtual machine support of runtime structural reflection

This page was built for publication:

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