4 papers
A Reversible Crumbling Abstract Machine for Plotkin's Call-by-Value
Nicolò Pizzo, Claudio Sacerdoti Coen
Landauer's embeddings enable the reversibility of computations for non-reversible programming languages, augmenting each intermediate state with enough data to reconstruct the prev…
Thinking Machines: Mathematical Reasoning in the Age of LLMs
Andrea Asperti, Alberto Naibo, Claudio Sacerdoti Coen
Large Language Models (LLMs) have demonstrated impressive capabilities in structured reasoning and symbolic tasks, with coding emerging as a particularly successful application. Th…
The Cost of Skeletal Call-by-Need, Smoothly
Beniamino Accattoli, Francesco Magliocca, Loïc Peyrot +1
Skeletal call-by-need is an optimization of call-by-need evaluation also known as "fully lazy sharing": when the duplication of a value has to take place, it is first split into "s…
Positive Sharing and Abstract Machines
Beniamino Accattoli, Claudio Sacerdoti Coen, Jui-Hsuan Wu
Wu's positive -calculus is a recent call-by-value -calculus with sharing coming from Miller and Wu's study of the proof-theoretical concept of focalization. Accattoli and W…