8 citations · 8 across the 2 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2020
Soundness conditions for big-step semantics
Francesco Dagnino, Viviana Bono, Elena Zucca +1
We propose a general proof technique to show that a predicate is sound, that is, prevents stuck computation, with respect to a big-step semantics. This result may look surprising,…
cs.PL2011★ 8 cited
Polymorphic Endpoint Types for Copyless Message Passing
Viviana Bono, Luca Padovani
We present PolySing#, a calculus that models process interaction based on copyless message passing, in the style of Singularity OS. We equip the calculus with a type system that ac…