3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.PL2010
Mechanized semantics
Xavier Leroy
The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and the…
cs.PL2009★ 3 cited
Compilation of extended recursion in call-by-value functional languages
Tom Hirschowitz, Xavier Leroy, J. B. Wells
This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recurs…
cs.PL2008
Coinductive big-step operational semantics
Xavier Leroy, Hervé Grall
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to de…