2 citations · 6 across the 13 of their papers we have counts for
3 papers · 1 filter
Semantics of a Relational λ-Calculus (Extended Version)
Pablo Barenbaum, Federico Lochbaum, Mariana Milicich
We extend the λ-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of express…
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…
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…