48 citations · 118 across the 8 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2015★ 2 cited
A Strong Distillery
Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza
Abstract machines for the strong evaluation of lambda-terms (that is, under abstractions) are a mostly neglected topic, despite their use in the implementation of proof assistants…
cs.PL2014★ 2 cited
Distilling Abstract Machines (Long Version)
Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza
It is well-known that many environment-based abstract machines can be seen as strategies in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear…