2 results
Delia Kesner ; Loïc Peyrot ; Daniel Ventura.
We define and study a term calculus implementing higher-order node replication. It is used to specify two different (weak) evaluation strategies: call-by-name and fully lazy call-by-need, that are shown to be observationally equivalent by using type theoretical technical tools.
Published on January 23, 2024
José Espírito Santo ; Delia Kesner ; Loïc Peyrot.
We introduce a call-by-name lambda-calculus $\lambda Jn$ with generalized applications which is equipped with distant reduction. This allows to unblock $\beta$-redexes without resorting to the standard permutative conversions of generalized applications used in the original $\Lambda J$-calculus with […]
Published on July 29, 2024