Bertrand Martin Dit Latour

Measurement of the Forward-Backward Asymmetry in t t Production at the Tevatron

We present

Introduction

At the Tevatron, top quark pairs are produced by quark-antiquark annihilation (85 %) and gluon fusion (15 %). Due to the quark-antiquark contribution, the initial state of the pp → t t + X process is not invariant under the charge conjugation symmetry C. As a consequence, even if the strong interaction is assumed to respect C, the final state t t + X is not expected to be charge symmetric. Under the assumption that QCD respects CP , the charge asymmetry in top pair events can be observed as an integrated forward-backward asymmetry defined as follows :

• in the pp rest frame,

A p p f b = N (cos θ t > 0) -N (cos θ t < 0) N (cos θ t > 0) + N (cos θ t < 0)
where θ t is the top quark production angle w.r.t. the beam axis in the pp rest frame ;

• in the t t rest frame,

A t t f b = N (∆y > 0) -N (∆y < 0) N (∆y > 0) + N (∆y < 0)
with ∆y = y t -yt is the rapidity difference between the top and the antitop. At Leading Order (LO), the condition ∆y > 0 is identical to cos θ * t > 0 , θ * t being measured in the t t rest frame.

At leading order of perturbation theory, the differential cross-section of top pair production is symmetric under the exchange t ↔ t . At Next to Leading Order (NLO), an asymmetry of order of 5% [1,2] appears through interferences between the Feynman graphs shown in Figure 1 : • the interference between Born and box diagrams gives a positive contribution [2] to the asymmetry of +6% ;

• the interference between Initial State Radiation (ISR) and Final State Radiation (FSR) diagrams contributes negatively to the asymmetry : -7% at NLO [2,3], reduced to -2% according to a recent Next to Next to Leading Order (NNLO) calculation [3].

DIS 2008

in2p3-00309009, version 1 -11 Sep 2008 DØ and CDF have measured the forward-backward asymmetry in the +jets final state (t t+X → ν q q b b+X), where both top and antitop decay into a W boson and a b quark, one W decaying leptonically and the other hadronically. Measurements are separately performed in the 4 exclusive and 5 inclusive jet bins to disentangle positive and negative contributions of q q → t t and q q → t t + g processes. Details about signal and background modeling, event selection and kinematics reconstruction of top pair events can be found in [4,5]. DØ measures a raw asymmetry, i.e. visible within the detector acceptance and distorted by reconstruction effects. The choice not to correct for acceptance comes from theoretical limitations : signal acceptance is estimated with MC@NLO [6], and the NNLO calculation indicates that the perturbative expansion has not converged yet at NLO. Reconstruction effects are parameterized through a dilution function defined as D = 2p -1 , where p is the probability to correctly reconstruct the sign of the rapidity difference ∆y . Dilution represents the fraction of visible asymmetry that is reconstructed in the detector, and is displayed in Figure 2. It originates from wrong kinematics reconstruction and incorrect measurement of the lepton charge.

DØ measurement of A t

The expected raw asymmetry in the Standard Model (SM) is computed by folding the MC@NLO predictions with the dilution function, within the geometrical acceptance :

A SM,raw f b = +∞ 0
A gen f b (∆y)D(∆y)f (∆y)d∆y , f : probability density of ∆y Using likelihood discriminant templates for t t , W +jets (whose V-A intrinsic asymmetry is reduced because kinematics is reconstructed under the t t assumption) and QCD multijet production, the data sample composition and the forward-backward asymmetry are extracted simultaneously with a maximum likelihood fit technique. The results obtained for different jet multiplicities on a 0.9 fb -1 data set are summarized in Table 1. Beyond the test of perturbative QCD predictions, the forward-backward asymmetry can be interpreted to probe new physics. DØ has investigated a scenario in which a heavy neutral gauge boson Z decays into a t t pair, which would result in a large positive asymmetry. The obtained limits on the fraction of top pairs produced via Z → t t are displayed in Figure 3. CDF has measured the forward-backward asymmetry in pp → t t + X events, in both t t and pp rest frames with 1.9 fb -1 of data [5]. As a first step, cos θ t and ∆y distributions are determined for signal (with MC@NLO), background, and data (see Figure 4). Background distributions are then explicitly subtracted from data distributions. At this stage of the analyses, raw asymmetries are computed for background-subtracted data and compared to t t expectations. Raw measurements are finally corrected back to parton level with the socalled matrix inversion technique. This method accounts for migration of events which are generated in certain bins of angular distributions but are reconstructed in other bins due to detector effects, and corrects for acceptance and efficiency biases as well. The predicted and observed asymmetries are shown in Table 1, before and after matrix inversion correction.

DIS 2008 in2p3-00309009, version 1 -11 Sep 2008 DØ 0.9 fb -1 , A tt f b (%) CDF 1.9 fb -1 , A tt f b (%) CDF 1.9 fb -1 , A p p f b (%) Data SM

Figure 1 :

 1 Figure 1: Feynman diagrams contributing to the forward-backward asymmetry at Next to Leading Order, via interferences (each single diagram gives a charge symmetric production, as QCD is indifferent to the electric charge).

Figure 2 :

 2 Figure2: Dilution and its uncertainty band as a function of the generated rapidity difference |∆y| , measured in t t + X events generated with PYTHIA[7] after full event reconstruction.

1 Figure 3 :

 13 Figure 3: Confidence intervals at 95% C.L. on the fraction of top pairs produced via Z → t t as a function of the Z mass, computed with Feldman-Cousins prescription [8]. The dashed curve and the solid blue curve represent the expected and observed limits respectively.

Figure 4 :

 4 Figure 4: Observed and predicted distributions of angular variables cos θ t and ∆y from which A p p f b and A t t f b are computed respectively. The light and dark grey histograms correspond to t t (as modeled by MC@NLO) and background expectations. The dashed curves show PYTHIA t t predictions reweighted to match the measured values of A f b . Distributions are shown before matrix inversion correction.

Table 1 :

 1 Integrated forward-backward asymmetries measured by DØ (in the t t rest frame) and CDF (both in t t and pp rest frames). Data measurements are compared to MC@NLO predictions. Asymmetries are not corrected for acceptance nor reconstruction effects, except in the last line of the table (*). Only statistical errors are mentioned.

			expected	Data	SM expected	Data	SM expected
	≥ 4 jets	12 ± 8	0.8 ± 0.2	11.9 ± 6.4	1.7 ± 0.7	13.0 ± 5.5	1.5 ± 1.6
	= 4 jets	19 ± 9	2.3 ± 0.2	13.2 ± 7.5	3.8 ± 0.8	12.0 ± 6.4	3.2 ± 1.8
	> 4 jets ≥ 4 jets*	-16 +15 -17	-4.9 ± 0.4	7.9 ± 12.3 24 ± 13	-3.3 ± 1.2 4 -7	16.0 ± 10.9 17 ± 7	-2.7 ± 3.2 4 ± 1

Acknowledgments

I gratefully thank Amnon Harel for his precious advices and subtle explanations about the DØ analysis. I would like to express my sincere acknowledgement to Elizaveta Shabalina, Christian Schwanenberger, Ulrich Heintz, and the organizers of the DIS conference. I am also grateful to Jeannine Wagner-Kuhr from CDF. Finally, I would like to thank the Fermilab staff and CNRS/IN2P3.


Xavier Leroy
email: xavier.leroy@inria.fr

Hervé Grall

Coinductive big-step operational semantics

Keywords: Coinduction, Operational semantics, Big-step semantics, Natural semantics, Small-step semantics, Reduction semantics, Type soundness, Compiler correctness, Mechanized proofs, The Coq proof

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 describe diverging evaluations in addition to terminating evaluations. We formalize the connections between the coinductive big-step semantics and the standard small-step semantics, proving that both semantics are equivalent. We then study the use of coinductive big-step semantics in proofs of type soundness and proofs of semantic preservation for compilers. A methodological originality of this paper is that all results have been proved using the Coq proof assistant. We explain the proof-theoretic presentation of coinductive definitions and proofs offered by Coq, and show that it facilitates the discovery and the presentation of the results.

Introduction

There exist two widely-used styles of operational semantics: big-step semantics, popularized by Kahn [START_REF] Kahn | Natural semantics[END_REF] under the name natural semantics, relates programs to the final results of their evaluations; small-step semantics, popularized by Plotkin [START_REF] Plotkin | A structural approach to operational semantics[END_REF][START_REF] Plotkin | A structural approach to operational semantics[END_REF] under the name structural operational semantics, repeatedly applies a one-step reduction relation to form reduction sequences. Small-step semantics is more expressive since it can describe the evaluation of both terminating and non-terminating programs, as finite or infinite reduction sequences, respectively. In contrast, big-step semantics describes only the evaluation of terminating programs, and fails to distinguish between nonterminating programs and programs that "go wrong". For this reason, smallstep semantics is generally preferred, in particular for proving the soundness of type systems.

However, big-step semantics is more convenient than small-step semantics for some applications. One that is dear to our heart is proving the correctness (preservation of program behaviours) of program transformations, especially compilation of a high-level programming language down to a lower-level language. The first author's experience and that of others [START_REF] Leroy | Formal certification of a compiler back-end, or: programming a compiler with a proof assistant[END_REF][START_REF] Klein | A machine-checked model for a Java-like language, virtual machine and compiler[END_REF][START_REF] Strecker | Compiler verification for C0[END_REF] is that fairly complex, optimizing compilation passes can be proved correct (for terminating source programs) relatively easily using big-step semantics and inductions on the structure of big-step evaluation derivations. In contrast, compiler correctness proofs using small-step semantics can address both terminating and diverging source programs, but are more difficult even for simple, non-optimizing compilation schemes [START_REF] Hardin | Functional runtimes within the lambdasigma calculus[END_REF].

In this article, we illustrate how coinductive definitions and proofs enable bigstep semantics to describe both terminating and diverging evaluations. The target of our study is a simple call-by-value functional language. We study two approaches: the first, initially proposed by Cousot and Cousot [START_REF] Cousot | Inductive definitions, semantics and abstract interpretation[END_REF], complements the normal inductive big-step evaluation rules for terminating evaluations with coinductive big-step rules describing diverging evaluations; the second simply interprets coinductively the normal big-step evaluation rules, thus enabling them to describe both terminating and non-terminating evaluations. These semantics are defined in sections 3 and 7, respectively.

The main technical results of this article are of two kinds. First, we prove that the coinductive big-step definition of divergence is equivalent to the more familiar definitions using either small-step semantics (section 4) or a simple form of denotational semantics (section 5). We also extend these equivalence results to trace semantics (section 6). Then, we study two applications of the big-step definition of divergence: a novel approach to stating and proving the soundness of type systems (section 8), and proofs of semantic preservation for compilation down to an abstract machine (section 9). An originality of this article is that all results were not only proved using a proof assistant (the Coq system), but even developed in interaction with this tool, and only then transcribed to standard mathematical notations. The Coq proof assistant [START_REF]The Coq proof assistant, software and documentation[END_REF][START_REF] Bertot | Interactive Theorem Proving and Program Development -Coq'Art: The Calculus of Inductive Constructions[END_REF] provides built-in support for coinductive definitions and proofs by coinduction. This support follows a proof-theoretic approach to induction and coinduction that we present in section 2 and relate with the standard approach using fixed points. The proof-theoretic approach leads to proofs by coinduction that are simpler than the standard arguments based on F -consistent relations [START_REF] Milner | Co-induction in relational semantics[END_REF][START_REF] Gapeyev | Recursive subtyping revealed[END_REF]. Our use of Coq has therefore been doubly beneficial: it facilitated the discovery and presentation of the results in this article, while at the same time generating strong confidence in them.

2 Induction and coinduction: A proof-theoretic approach Following the classical presentation of Aczel [START_REF] Aczel | An introduction to inductive definitions[END_REF], an inference system over a set U of judgments is a set of inference rules. An inference rule is an ordered pair (A, c), where c ∈ U is the conclusion of the rule and A ⊆ U is the set of its premises or antecedents. A rule is usually written as follows:

A c
The intuitive interpretation of this rule is that the judgment c can be inferred from the set of judgments A.

Fixed-point approach

One way to give meaning to an inference system is to consider the fixed points of the associated inference operator. If Φ is an inference system over U, we define the operator F Φ : ℘(U) → ℘(U) as F Φ (S) = {c ∈ U | ∃A ⊆ S, (A, c) ∈ Φ}.

In other terms, F Φ (S) is the set of judgments that can be inferred in one step from the judgments in S by using the inference rules.

A set S is said to be closed if F Φ (S) ⊆ S, and consistent if S ⊆ F Φ (S). A closed set S is such that no new judgments can be inferred from S. A consistent set S is such that all judgments that cannot be inferred from S are not in S.

The inference operator is monotone: F Φ (S) ⊆ F Φ (S ′ ) if S ⊆ S ′ . By Tarski's fixed point theorem for complete lattices [14, p. 286], it follows that the inference operator possesses both a least fixed point and a greatest fixed point, which are the smallest F Φ -closed set and the largest F Φ -consistent set, respectively.

lfp(F

Φ ) = {S | F Φ (S) ⊆ S} gfp(F Φ ) = {S | S ⊆ F Φ (S)}
The least fixed point lfp(F Φ ) is the inductive interpretation of the inference system Φ, and the greatest fixed point gfp(F Φ ) is its coinductive interpretation. These interpretations lead to the following two proof principles:

• Induction principle: to prove that all judgments in the inductive interpretation belong to a set S, show that S is F Φ -closed. • Coinduction principle: to prove that all judgments in a set S belong to the coinductive interpretation, show that S is F Φ -consistent.

Proof-theoretic approach

In contrast with the fixed point approach, the proof-theoretic approach starts from the proofs admissible in an inference system. These proofs naturally correspond to derivations, also called proof trees. These are trees whose nodes are labeled with judgments c ∈ U and such that for all nodes n, the label c of n and the labels A of the children of n correspond to an inference rule: (A, c) ∈ Φ. The conclusion of a derivation is the label of its root node.

A derivation d is well-founded if it has no infinite branch; d is ill-founded otherwise. If every rule in Φ has a finite set of premises, well-founded derivations are finite while ill-founded derivations are infinite.

In the proof-theoretic approach, the inductive interpretation of the inference system Φ is the set ∆(Φ) of conclusions of well-founded derivations, while the coinductive interpretation is the set ∇(Φ) of conclusions of arbitrary derivations (ill-founded or well-founded). These interpretations come with the following proof principles:

• Induction principle: to prove that all judgments in the inductive interpretation belong to a set S, proceed by structural induction over well-founded derivations. That is, show that c ∈ S if c is the conclusion of a derivation d, assuming that j ∈ S for all conclusions j of the strict subderivations of d. • Coinduction principle: to prove that all judgments in a set S are in the coinductive interpretation, build a system of recursive equations between derivations, with unknowns (x j ) j∈S . Each equation is of the form

x j = x j 1 x j 2 . . . j
and must be justified by an inference rule: ({j 1 , j 2 , . . .}, j) ∈ Φ. These equations are guarded, meaning that there are no trivial equations x j = x j ′ . It follows that the system has a unique solution [START_REF] Courcelle | Arbres infinis et systèmes d'équations[END_REF], and this solution σ is such that for all j ∈ S, σ(x j ) is a valid derivation that proves j. Therefore, all j ∈ S are also in ∇(Φ).

Equivalence between the two approaches

The following theorem shows that the interpretations defined using fixed points and using derivations coincide.

Theorem 1 For all inference systems Φ, lfp(F Φ ) = ∆(Φ) and gfp(F Φ ) = ∇(Φ).

Proof. It is easy to show that ∆(Φ) is F Φ -closed and that ∇(Φ) is F Φ - consistent. Therefore, lfp(F Φ ) ⊆ ∆(Φ) and ∇(Φ) ⊆ gfp(F Φ ).
Consider a F Φ -closed set S. A structural induction over well-founded deriva-

tions d shows that the conclusion of d is in S. Therefore, ∆(Φ) ⊆ S. Since lfp(F Φ ) is F Φ -closed, the inclusion ∆(Φ) ⊆ lfp(F Φ ) follows.
Finally, consider a F Φ -consistent set S. For any judgment j in S, there exists a rule (K j , j) in Φ, where K j ⊆ S. We define a system of guarded recursive equations, with variables (x j ) j∈S .

x j = (x k ) k∈K j j
The solution σ of this system is such that for all j ∈ S, the derivation σ(x j ) is valid in Φ and proves j. Therefore, S ⊆ ∇(Φ). Since gfp(F Φ ) is F Φ -consistent, the inclusion gfp(F Φ ) ⊆ ∇(Φ) follows. P

The equality lfp(F Φ ) = ∆(Φ) is proved by Aczel [START_REF] Aczel | An introduction to inductive definitions[END_REF]. The equality gfp(F Φ ) = ∇(Φ) is proved in the second author's PhD dissertation [16, p. 77], but to our knowledge there is no other published proof. This is, however, a well-known result. For instance, it has recently been used to extend logic programming with coinductive terms and derivations [START_REF] Simon | Coinductive logic programming[END_REF].

Induction and coinduction in the Coq proof assistant

The Coq proof assistant that we use to develop the present work follows the proof-theoretic formulation of induction and coinduction. In accordance with the propositions-as-types, proofs-as-programs paradigm, inference systems are presented as inductively or coinductively-defined predicates, resembling data type definitions in ML or Haskell. Such a predicate is defined by a set of constructors, corresponding to inference rules. Applied to terms representing proofs for its premises, a constructor returns a proof term for its conclusion.

Proofs by induction and by coinduction are both represented as recursive functions. For a proof by induction, the Coq type system demands that the recursive function be structural : the arguments to recursive calls are strict subterms of the recursive parameter. For a proof by coinduction, the Coq type system demands that the recursive function be productive: its result is a constructor application, and the results of recursive calls are only used as arguments to this constructor. Such productive recursive functions correspond closely to the systems of guarded equations used above.

While proof terms can be provided explicitly by the user, most of the time they are built incrementally by the Coq proof assistant in response to tactics entered by the user. When using tactics, proofs by coinduction are as easy to conduct as proofs by induction: in response to the cofix tactic, the system provides the expected result as an additional hypothesis, then makes sure that this hypothesis is only used in positions permitted by productive recursive functions. (See [START_REF] Giménez | Codifying guarded definitions with recursive schemes[END_REF] and [10, chap. 13] for more details, and the proof of lemma 5 below for a concrete example.) The proof sketches we give in the remainder of this article are written in the same proof style, and play fast and loose with coinduction. In particular, except for the very first proofs, we do not exhibit F Φ -consistent sets nor systems of guarded equations between derivations. The skeptical reader is referred to the corresponding Coq development [START_REF] Leroy | Coinductive big-step operational semantics -the Coq development[END_REF] for full details.

Coq is based on a constructive logic (the Calculus of Constructions), but proofs in classical logic can be expressed in Coq by adding axioms that are known to be consistent with Coq's logic. The majority of our proofs are constructive, but some use the axiom of excluded middle. The proofs that use this axiom are marked "(classical)".

3 The language and its big-step semantics

The language we consider in this article is the λ-calculus extended with constants: the simplest functional language that exhibits run-time errors (terms that "go wrong"). Its syntax is as follows:

Variables: x, y, z, . . . Constants:

c ::= 0 | 1 | . . . Terms: a, b, v ::= x | c | λx.a | a b
We write a[x ← b] for the capture-avoiding substitution 1 of b for all free occurrences of x in a. We say that a term v is a value, and write v ∈ Values, if v is either a constant c or an abstraction λx.b.

The standard call-by-value semantics in big-step style for this language is defined by the inductive interpretation of the following inference rules. They define the relation a ⇒ v (read: "a evaluates to v").

c ⇒ c (⇒-const) λx.a ⇒ λx.a (⇒-fun)

a 1 ⇒ λx.b a 2 ⇒ v 2 b[x ← v 2 ] ⇒ v a 1 a 2 ⇒ v (⇒-app) Lemma 2 If a ⇒ v, then v ∈ Values.
Proof. Induction on a derivation of a ⇒ v.

P Lemma 3 The ⇒ relation is deterministic: if a ⇒ v and a ⇒ v ′ , then v = v ′ .
Proof. By induction on the derivation of a ⇒ v and case analysis over that of a ⇒ v ′ . P

The rules above capture only terminating evaluations. Writing δ = λx. x x and ω = δ δ, we have for instance:

Lemma 4 ω ⇒ v is false for all terms v.
Proof. We show that a ⇒ v implies a = ω by induction on the derivation of a ⇒ v. P Following Cousot and Cousot [START_REF] Cousot | Inductive definitions, semantics and abstract interpretation[END_REF] and the second author's PhD work [START_REF] Grall | Deux critères de sécurité pour l'exécution de code mobile[END_REF], we define divergence (infinite evaluations) by the coinductive interpretation2 of the following inference rules. They define the relation a ∞ ⇒ (read: "a diverges").

a 1 ∞ ⇒ a 1 a 2 ∞ ⇒ ( ∞ ⇒-app-l) a 1 ⇒ v a 2 ∞ ⇒ a 1 a 2 ∞ ⇒ ( ∞ ⇒-app-r) a 1 ⇒ λx.b a 2 ⇒ v b[x ← v] ∞ ⇒ a 1 a 2 ∞ ⇒ ( ∞ ⇒-app-f)
Note that we have imposed (arbitrarily) a left-to-right evaluation order for applications.

Lemma 5 ω ∞ ⇒ holds.

Proof. The proof is by coinduction. Assume ω ∞ ⇒ as coinduction hypothesis. We can derive ω ∞ ⇒ with rule ( ∞ ⇒-app-f), using the coinduction hypothesis as third premise.

Since this is the first proof by coinduction in this article, we now detail the proof sketch given above using the various approaches outlined in section 2.

Greatest fixed point. Consider the inference operator F associated with the rules defining ∞ ⇒, namely

F (S) = {a 1 a 2 | a 1 ∈ S} ∪ {a 1 a 2 | ∃v, a 1 ⇒ v ∧ a 2 ∈ S} ∪ {a 1 a 2 | ∃x, b, v, a 1 ⇒ λx.b ∧ a 2 ⇒ v ∧ b[x ← v] ∈ S}
The set S = {ω} is F -consistent. Indeed, ω ∈ F ({ω}) by the third line of the definition of F . Therefore, S ⊆ gfp(F ), implying that ω ∞ ⇒ holds.

Systems of guarded recursive equations. Consider the following equation with unknown d (a derivation):

d = δ ⇒ λx. x x δ ⇒ δ d δ δ ∞ ⇒ Since (x x)[x ← δ] = δ δ, this equation is justified by rule ( ∞ ⇒-app-f).
Moreover, it is guarded. Therefore, its solution is a valid derivation that proves δ δ ∞ ⇒ . It follows that this judgment holds.

Coq proof term. Consider the Coq proof term evalinf_omega defined by the following corecursion:

CoFixpoint evalinf_omega : evalinf omega := let eval_delta : eval delta delta := eval_fun x (App (Var x) (Var x)) in evalinf_app_f delta delta x (App (Var x) (Var x)) delta eval_delta eval_delta evalinf_omega.

The two constructor functions eval_fun and evalinf_app_f correspond to the inference rules (⇒-fun) and ( ∞ ⇒-app-f), respectively. They receive as arguments instantiations for the free variables of the rules (x and a for (⇒-fun); a 1 , a 2 , x, b, v for ( ∞ ⇒-app-f)), followed by proof terms for their premises (proofs of δ ⇒ δ, δ ⇒ δ and ω ∞ ⇒ for ( ∞ ⇒-app-f)). The term evalinf_omega has type evalinf omega, which proves that this proposition representing ω ∞ ⇒ is true.

Coq proof script. The following commented sequence of tactics builds the proof term above in an interactive manner.

Lemma evalinf_omega: evalinf omega. Proof.

cofix COINDHYP. Prepare a proof by coinduction. The current goal ω ∞ ⇒ becomes an hypothesis named COINDHYP unfold omega. eapply evalinf_app_f.

Apply the constructor for rule ∞ ⇒-app-f unfold delta. apply eval_fun.

Prove the first premise (evaluation of δ) unfold delta. apply eval_fun.

Prove the second premise (evaluation of δ) simpl. fold delta. fold omega.

Replace (x x)[x ← δ] by ω. apply COINDHYP.

Prove the third premise by invoking the coinduction hypothesis. Qed.

P Lemma 6 a ⇒ v and a ∞ ⇒ are mutually exclusive.
Proof. By induction on the derivation of a ⇒ v, case analysis on that of a ∞ ⇒ , and lemma 3. P Programs that neither evaluate nor diverge according to the rules above are said to "go wrong". For instance, the program 0 0 goes wrong since neither 0 0 ⇒ v nor 0 0 ∞ ⇒ hold for any v.

Relation with small-step semantics

The one-step reduction relation → is defined by the call-by-value β-reduction axiom plus two context rules for reducing under applications, assuming leftto-right evaluation order.

v ∈ Values (λx.a) v → a[x ← v] (→-β) a 1 → a 2 a 1 b → a 2 b (→-app-l) a ∈ Values b 1 → b 2 a b 1 → a b 2 (→-app-r) Lemma 7 The → relation is deterministic: if a → a ′ and a → a ′′ , then a ′ = a ′′ .
Proof. By induction on the derivation of a → a ′ and case analysis over that of a → a ′′ . P

There are three kinds of reduction sequences of interest. The first, written a * → b ("a reduces to b in zero, one or several steps"), is the standard reflexive transitive closure of →; it captures finite reductions. The second, written a ∞ → ("a reduces infinitely"), captures infinite reductions. The third, written a co * → b ("a reduces to b in zero, one, several or infinitely many steps"), is the coinductive interpretation of the rules for reflexive transitive closure; it captures both finite and infinite reductions. These relations are defined by the following rules, interpreted inductively for * → and coinductively for We now turn to relating the reduction relations (small-step) and the evaluation relations (big-step). It is well known that normal evaluation is equivalent to finite reduction to a value.

∞ → and co * →. a * → a a co * → a a → a ′ a ′ * → b a * → b a → a ′ a ′ ∞ → a ∞ → a → a ′ a ′ co * → b a co * → b It is true that co * → is the union of *
Theorem 9 a ⇒ v if and only if a * → v and v ∈ Values.
Proof. The "only if" part is an easy induction on a ⇒ v. For the "if" part, we first show the following two lemmas:

(1) v ⇒ v if v ∈ Values, and (2) a ⇒ v if a → b and b ⇒ v. The result follows by induction on the proof of a * → v. P Similarly, divergence ( ∞ ⇒) is equivalent to infinite reduction ( ∞ →).
The proof uses the following lemma. Proof (classical). For the "only if" part, we first show that a

∞ ⇒ implies ∃b, a → b ∧ b ∞
⇒ by structural induction on a, then conclude by coinduction. For the "if" part, we proceed by coinduction and case analysis over a. The only non-trivial case is a = a 1 a 2 . Using lemma 10, we distinguish three cases:

(1) a 1 reduces infinitely; (2) a 1 reduces to a value but a 2 reduces infinitely;

(3) a 1 and a 2 reduce to values λx.b and v respectively, and b[x ← v] reduces infinitely. We conclude a ∞ ⇒ by applying the appropriate inference rule for each case, the coinduction hypothesis for the ∞ ⇒ premise, and theorem 9 for the ⇒ premises. P

Relation with denotational semantics

Denotational semantics is an alternate way to characterize divergent and convergent terms. In this section, we develop a simple denotational semantics for call-by-value λ-calculus and prove that it captures the same notions of convergence and divergence as our big-step operational semantics. To facilitate the mechanization of these results in the Coq theorem prover, we adopt an elementary presentation of the denotational semantics that does not require the full generality of Scott domains.

We define the computation C n (a) of a term a at maximal recursion depth n ∈ IN by recursion over n, as follows.

C 0 (a) = ⊥ C n+1 (x) = err C n+1 (c) = c C n+1 (λx.a) = λx.a C n+1 (a 1 a 2 ) = C n (a 1 ) £ (v 1 → C n (a 2 ) £ (v 2 → if v 1 = λx.b then C n (b[x ← v 2 ]) else err))
The monadic composition operator £ used in the application case is defined by

⊥ £ f = ⊥ err £ f = err v £ f = f (v).
The result of C n (a), or in other terms the outcome of executing a at depth n, is one of the following three possibilities: (1) a value v, denoting normal termination with v as final value; (2) the symbol err, denoting abrupt termination on a run-time error (such as encountering a free variable or an application of a constant); (3) the symbol ⊥, indicating that the computation cannot complete within n recursive steps.

The flat ordering ≤ over results is defined by ⊥ ≤ r and r ≤ r for all r. The C function is monotone with respect to this ordering:

Lemma 12 If n ≤ m, then C n (a) ≤ C m (a).
Proof. By induction over n and case analysis over a. P

We say that a term a executes with result r, or in other terms that r is the denotation of a, and we write D(a, r), if C n (a) = r for almost all n:

D(a, r) def = ∃p, ∀n, n ≥ p =⇒ C n (a) = r.
Since C is monotone, the following properties hold trivially: It follows that every term has one and exactly one denotation.

Lemma 16 For all terms a, there exists a result r such that D(a, r). Proof. Notice that r 1 = C n (a) = r 2 for sufficiently large n. P

We now relate this denotational semantics with the big-step operational semantics of section 3, starting with the terminating case.

Theorem 18 a ⇒ v if and only if D(a, v).

Proof. For the "if" part, we show that C n (a) = v implies a ⇒ v by induction over n and case analysis over a and over the results of the recursive computations. The case a = x contradicts the hypothesis C n (a) = v. For the cases a = c or a = λx.b, we have v = a by definition of C and the result follows by rules (⇒-const) or (⇒-fun). Finally, if a = a 1 a 2 , the exploitation of the hypothesis

C n (a) = v leads to C n-1 (a 1 ) = λx.b and C n-1 (a 2 ) = v 2 and C n-1 (b[x ← v 2 ]) = v.
The result follows from the induction hypothesis and rule (⇒-app).

For the "only if" part, we proceed by induction over the derivation of a ⇒ v and exhibit an n such that C n (a) = v. From this, D(a, v) follows by lemma 14.

The cases where a is a constant or a function are trivial, since C 1 (a) = v in these cases. For the application case a = a 1 a 2 , the induction hypothesis leads to

C n 1 (a 1 ) = λx.b and C n 2 (a 2 ) = v 2 and C n 3 (b[x ← v 2 ]) = v for some n 1 , n 2 , n 3 . Taking n = 1 + max(n 1 , n 2 , n 3 ), we have C n (a) = v
∞ ⇒ . In all three cases, a = a 1 a 2 . If a 1 ∞ ⇒ , C n (a) = C n-1 (a 1 ) = ⊥ by induction hypothesis. If a 1 ⇒ v 1 and a 2 ∞ ⇒ , we have D(a, v 1 ) by theorem 18. By induction hypothesis, C n-1 (a 2 ) = ⊥. By lemma 13, either C n-1 (a 1 ) = ⊥ or C n-1 (a 1 ) = v 1 . In both cases, C n (a) = ⊥. The third and last case (a 1 ⇒ λx.b and a 2 ⇒ v 2 and b[x ← v 2 ] ∞ ⇒ ) is similar.
The "if" part is proved by coinduction and case analysis over a. The cases a = x, a = c and a = λx.b trivially contradict the hypothesis D(a, ⊥). Therefore, it must be the case that a = a 1 a 2 . Let r 1 and r 2 be the denotations of a 1 and a 2 . (They exist by lemma 16.) We argue by case over r 1 and r 2 , exploiting the definition of C for sufficiently large values of n. There are only three cases that do not contradict the hypothesis D(a, ⊥):

(1) r 1 = ⊥; (2) r 1 is a value v 1 and r 2 = ⊥; (3) r 1 is a value λx.b and r 2 is a value v 2 and D(b[x ← v 2 ], ⊥).
We conclude a ∞ ⇒ by applying the appropriate inference rule for each case, the coinduction hypothesis for the ∞ ⇒ premise, and theorem 18 for the ⇒ premises. P

Extension to trace semantics

Besides expressing both terminating and diverging executions, small-step semantics have another advantage over big-step semantics: reduction sequences contain all intermediate reducts of the source term in addition to its final value, therefore providing a complete trace of the execution. Such execution traces are useful both for static analysis (by abstract interpretation of collecting semantics) and to state and prove stronger semantic preservation properties for program transformations. In particular, when the input language is imperative and features observable actions such as input/output, traces of observable events are crucial to state and prove observational equivalence results.

In this section, following the second author's work [START_REF] Grall | Deux critères de sécurité pour l'exécution de code mobile[END_REF], we show how to extend the big-step semantics of section 3 so that they produce not only the outcome of an evaluation (final value or divergence), but also a (possibly infinite) execution trace.

Traces

The traces we consider are finite or infinite sequences of terms representing the intermediate reducts of the source program. By abuse of notation, we write t.t ′ and t.T for the concatenation of a finite trace t and a finite or infinite trace. Concatenation is associative and ǫ is a neutral element for concatenation.

If t = a 1 .a 2 . . . a n is a finite trace, we define the left application t b of this trace to a term b and the right application v t of a value v to this trace as follows:

t b = (a 1 b).(a 2 b) . . . (a n b) v t = (v a 1 ).(v a 2 ) . . . (v a n )
We similarly define the applications T b and v T where T is an infinite trace.

We define bisimilarity between infinite traces, written T 1 ∼ = T 2 , by the following coinductive rule:

T 1 ∼ = T 2
a.T 1 ∼ = a.T 2 Concatenation and application of traces are compatible with bisimilarity.

In set theory, bisimilarity is equivalent to equality. In Coq's constructive logic, bisimilarity is coarser than equality: there exists infinite traces that are bisimilar but cannot be proved equal [10, chap. 13]. Some of the following results require the use of bisimilarity instead of equality in definitions and statements, in order to be provable in Coq.

Small-step semantics with traces

While our objective is to instrument big-step semantics to produce execution traces, we start by doing this for the small-step semantics, which is easier and helps us define precisely the traces we expect for an execution. For a finite reduction sequence a 1 → a 2 → • • • → a n-1 → a n , the expected (finite) trace is t = a 1 .a 2 . . . a n-1 , that is, the initial term and its intermediate reducts but not the final term. Equivalently, the trace comprises the source terms for all reduction steps performed in the sequence. This is formalized by the following rules for the predicate a * → a ′ / t (read: "a reduces in zero, one or several steps to a ′ with trace t").

a * → a / ǫ a → a ′ a ′ * → b / t a * → b / a.t
For an infinite reduction sequence a 1 → . . . → a n → . . ., the expected (infinite) trace is T = a 1 . . . a n . . . This is captured by the following coinductive rule defining the predicate a ∞ → / T (read: "a reduces infinitely with trace T ").

a → b b ∞ → / T a ∞ → / a.T
It is intuitively clear that the small-step semantics with traces is a refinement of that without traces. We now formalize this intuition, which is not obvious to prove constructively in the case of infinite reductions. Proof. The "if" part is an easy proof by coinduction. The "only if" part is more involved: since the conclusion ∃T, a ∞ → / T is not a coinductivelydefined predicate, we cannot reason directly by coinduction. Instead, we must construct explicitly a suitable infinite trace T . To this end, we first define a reduction function R from terms to optional terms that is equivalent to the one-step reduction predicate, that is

R(a) = Some(b), if a → b; None, if a →.
This function is total (by induction over a), therefore proving that one-step reduction is decidable. Next, to every term a we associate an infinite trace T (a) of all the successive reducts of a. This trace is defined, by guarded corecursion, as

T (a) = a.T (b), if R(a) = Some(b); a.T (a), if R(a) = None.
We then show that a Additionally, the trace-based reduction relations are deterministic up to bisimilarity between infinite traces. This is an immediate consequence of the determinism of one-step reductions (lemma 7).

Lemma 23 If a * → v 1 / t 1 and a * → v 2 / t 2 , then t 1 = t 2 and v 1 = v 2 . Lemma 24 If a ∞ → / T 1 and a ∞ → / T 2 , then T 1 ∼ = T 2 .
Note that the stronger conclusion T 1 = T 2 is not provable in Coq. Another consequence of the determinism of one-step reductions is the following obvious decomposition property for infinite reductions.

Big-step semantics with traces

We now add traces to the big-step definitions of evaluation and divergence. The corresponding predicates are a ⇒ v / t ("a evaluates to v with finite trace t") and a ∞ ⇒ / T ("a diverges with infinite trace T ").

c ⇒ c / ǫ (⇒-const)
λx.a ⇒ λx.a / ǫ (⇒-fun)

a 1 ⇒ λx.b / t 1 a 2 ⇒ v 2 / t 2 b[x ← v 2 ] ⇒ v / t 3 t = (t 1 a 2 ).((λx.b) t 2 ).((λx.b) v 2 ).t 3 a 1 a 2 ⇒ v / t (⇒-app) a 1 ∞ ⇒ / T 1 T ∼ = T 1 a 2 a 1 a 2 ∞ ⇒ / T ( ∞ ⇒-app-l) a 1 ⇒ v / t 1 a 2 ∞ ⇒ / T 2 T ∼ = (t 1 a 2 ).(v T 2 ) a 1 a 2 ∞ ⇒ / T ( ∞ ⇒-app-r) a 1 ⇒ λx.b / t 1 a 2 ⇒ v 2 / t 2 b[x ← v 2 ] ∞ ⇒ / T 3 T ∼ = (t 1 a 2 ).((λx.b) t 2 ).((λx.b) v 2 ).T 3 a 1 a 2 ∞ ⇒ / T ( ∞ ⇒-app-f)
The construction of the trace in the rules for applications is justified as follows. Assume, for instance, a 1 ⇒ λx.b / t 1 and a 2 ⇒ v 2 / t 2 . The application a 1 a 2 performs one β-reduction (λx.b) v 2 → b[x ← v 2 ] in addition to those coming from the evaluations of the premises of the rule. The source term for this reduction, (λx.b) v 2 , is therefore added to the trace. It is preceded by t 1 a 2 (the trace for a 1 put into a left application context [ ] a 2 ) and by (λx.b) t 2 (the trace for a 2 put into a right application context (λx.b) [ ]). The source of the β-reduction is then followed by the trace corresponding to the evaluation of the function body

b[x ← v 2 ].
Another point to note is the use of bisimilarity T ∼ = . . . instead of equality T = . . . in the coinductive rules defining ∞ ⇒. This allows traces to be replaced by bisimilar traces at every inference step, therefore enabling us to prove more statements about ∞ ⇒ within the limits of Coq's coinductive proofs. (For instance, the proof of theorem 31 no longer goes through if ∞ ⇒ is defined with equalities between traces instead of bisimilarities.) This subtle point is moot in set theory, where bisimilarity is equivalent to equality.

Lemma 26 ω

∞ ⇒ / T holds where T is the infinite trace ω.ω.ω . . .

Proof. By coinduction, using rule (

∞ ⇒-app-f). P

Equivalence between the trace semantics

We now show the equivalence between the big-step and small-step semantics with traces, extending the results of section 4.

Theorem 27 a ⇒ v / t if and only if a * → v / t and v ∈ Values.

Proof. The "only if" part is an easy induction on the derivation of a ⇒ v / t. For the "if" part, we first show the following two lemmas:

(1) v ⇒ v / ǫ if v ∈ Values,
∞, ∼ = -→ / T ′ T ∼ = a.T ′ a ∞, ∼ =
-→ / T This variant enables us to replace the infinite trace T by a bisimilar one at every proof step, while remaining within the subset of proofs that Coq accepts as productively coinductive. We can therefore show that a ∞ ⇒ / T implies a ∞, ∼ = -→ / T by coinduction, using the decomposition property stated earlier. We conclude by proving that a ∞, ∼ = -→ /T implies a ∞ → /T , again by coinduction. P

As a corollary of theorem 28, the big-step divergence relation ∞ ⇒ is deterministic up to bisimilarity of the traces. It is interesting to note that we could not find a more direct Coq proof of this fact.

Lemma 29 If a ∞ ⇒ / T 1 and a ∞ ⇒ / T 2 , then T 1 ∼ = T 2 .
Proof. Follows from lemma 24 and theorem 28. P

The converse of theorem 28 relies on the following inversion lemma for infinite reduction sequences starting with an application. Proof (classical). The proof proceeds by coinduction and case analysis over a. It must be the case that a = a 1 a 2 , otherwise a cannot reduce infinitely.

Lemma 30 Assume a b ∞ → / T . (1) If a ∞ → / T ′ , then T ∼ = T ′ b. (2) If a ∈ Values and b ∞ → / T ′ , then T ∼ = a T ′ . (3) If a * → a ′ / t, then there exists T ′ such that a ′ b ∞ → / T ′ and T = (t b).T ′ . ( 4
Using lemma 22, we distinguish three cases:

(

Definition and properties

So far, we have described terminating and non-terminating evaluations using two separate sets of inference rules, one interpreted inductively and the other coinductively. An attempt to describe both kinds of evaluations at the same time, in a more concise way, is to interpret coinductively the standard evaluation rules for terminating evaluations. This defines the relation

a co ⇒ b (read: "a coevaluates to b"). c co ⇒ c ( co ⇒-const) λx.a co ⇒ λx.a ( co ⇒-fun) a 1 co ⇒ λx.b a 2 co ⇒ v 2 b[x ← v 2 ] co ⇒ v a 1 a 2 co ⇒ v ( co ⇒-app)
It is clear from the definition of co ⇒ that coevaluation includes all terminating evaluations, plus some diverging ones.

[x ← v 2 ] co ⇒ v.
Using excluded middle, it must be that at least one of these three terms does not evaluate, otherwise, a ⇒ v would hold. The result follows by applying the rule for ∞ ⇒ that matches the term that does not evaluate, and using the coinduction hypothesis. P However, the reverse implication from evaluation to coevaluation does not hold: there exists terms that diverge but do not coevaluate. Consider for instance a = ω (0 0). It is true that a ∞ ⇒ , but there is no term v such that a co ⇒ v, because the coevaluation of the argument 0 0 goes wrong (there is no v such that 0 0 co ⇒ v). Section 8.2 shows another example of a diverging term that does not coevaluate, this time involving no subterm that goes wrong.

Another unusual feature of coevaluation is that it is not deterministic. For instance, ω co ⇒ v for any term v. However, co ⇒ is deterministic for terminating terms, in the following sense:

Lemma 35 If a ⇒ v and a co ⇒ v ′ , then v ′ = v.
Proof. By induction on the derivation of a ⇒ v and inversion on a co ⇒ v ′ . P Moreover, there exists diverging terms that coevaluate to only one value. An example is (λx.0) ω, which coevaluates to 0 but not to any other term.

Connection with small-step semantics

Concerning the connections between coevaluation (big-step) and coreduction (small-step) in the style of section 4, the expected equivalence between co ⇒ and co * → holds in one direction only.

Lemma 36 a co ⇒ v implies a co * → v.
Proof. Using classical logic, this follows from lemmas 34 and equivalence theorems 9, 11 and 8. However, the result can be proved directly in constructive logic. We first show that a

Coevaluation for CPS terms

Notwithstanding the negative results of sections 7.1 and 7.2, there exists a class of terms for which coevaluation correctly captures both terminating and diverging evaluations: terms that are in continuation-passing style (CPS). A distinguishing feature of these terms is that function arguments are always values. CPS terms are defined by the following grammar:

a ∈ Atoms ::= x | c | λx.b b ∈ CPS-terms ::= a | b a
Less formally, CPS terms are built from atoms (variables, constants and function abstractions) using multiple applications in tail-call position.

It is well known that CPS terms are stable by substitution of atoms for variables. Proof. By induction on the derivation of b ⇒ v, using lemma 37 for the application case. P

The main result of this section is that a closed CPS term coevaluates to a value if and only if it evaluates or it diverges. The restriction to closed terms is important since, for instance, the CPS term ω x diverges but its coevaluation goes wrong on the free variable x.

The following lemma lists useful properties of CPS atoms.

Lemma 39 Let a ∈ Atoms.

(

) a ⇒ a if a is closed. (2) It is not the case that a ∞ ⇒ . (3) If a ⇒ v, then v = a. 1
The key technical lemma below shows that diverging, closed CPS terms coevaluate to a well-chosen value. We now turn to using our coinductive evaluation and reduction relations for proving the soundness of type systems. To be more specific, we will use the simply-typed λ-calculus with recursive types as our type system. We obtain recursive types by interpreting the type algebra τ ::= int | τ 1 → τ 2 coinductively, as in [START_REF] Gapeyev | Recursive subtyping revealed[END_REF]. The typing rules are recalled below. Type environments, written E, are finite maps from variables to types.

E(x) = τ E ⊢ x : τ E ⊢ c : int E + {x : τ ′ } ⊢ a : τ E ⊢ λx.a : τ ′ → τ E ⊢ a 1 : τ ′ → τ E ⊢ a 2 : τ ′ E ⊢ a 1 a 2 : τ
Enabling recursive types makes the type system non-normalizing and makes it possible to write interesting programs. In particular, the call-by-value fixpoint operator Y = λf. (λx. f (x x)) (λx. f (λy. (x x) y)) is well-typed, with types ((τ → τ ′ ) → τ → τ ′ ) → τ → τ ′ for all types τ and τ ′ . (The self-applications x x are well-typed under the assumption x : σ, where the recursive type σ is defined by the equation σ = σ → τ → τ ′ .)

8.1 Type soundness proofs using small-step semantics Wright and Felleisen [START_REF] Wright | A syntactic approach to type soundness[END_REF] introduced a proof technique for showing type soundness that relies on small-step semantics and is standard nowadays. The proof relies on the twin properties of type preservation (also called subject reduction) and progress: Proof. We first show that ∅ ⊢ b : τ by induction over a * → b, using the preservation lemma. We then conclude with the progress lemma. P

The authors that follow this approach then conclude that well-typed closed terms either reduce to a value or reduce infinitely. However, this conclusion is generally neither expressed nor proved formally. In our approach, it is easy to do so: The standard big-step semantics (defined by the ⇒ relation) is awkward for proving type soundness because it does not distinguish between terms that diverge and terms that go wrong: in both cases, there is no value v such that a ⇒ v. Consequently, the obvious type soundness statement "if ∅ ⊢ a : τ , there exists v such that a ⇒ v" is false for all type systems that do not guarantee normalization. The best result we can prove, then, is the following big-step equivalent to the preservation lemma:

Lemma 48 (Preservation, big-step style) If a ⇒ v and ∅ ⊢ a : τ , then ∅ ⊢ v : τ .

Proof. Easy induction on the derivation of a ⇒ v, using the fact that typing is stable by substitution: if {x : τ ′ } ⊢ a : τ and ∅ ⊢ b : τ ′ , then ∅ ⊢ a[x ← b] : τ . P

The standard approach for proving type soundness using big-step semantics is to provide inductive inference rules to define a predicate a ⇒ err characterizing terms that go wrong because of a type error, and prove the statement "if ∅ ⊢ a : τ , then it is not the case that a ⇒ err" [START_REF] Tofte | Operational semantics and polymorphic type inference[END_REF]. This approach is not those for normal evaluations, namely the rules for divergence. This can easily double the size of the specification of a dynamic semantics, which is a concern for realistic languages where the normal evaluation rules number in dozens.

The coevaluation relation co ⇒ is attractive for this pragmatic reason, as it has the same number of rules as normal evaluation. Of course, we have seen that a co ⇒ v is not equivalent to a ⇒ v ∨ a ∞ ⇒ , but the example we gave was for a diverging term a that is not typeable and where an early diverging evaluation "hides" a later evaluation that goes wrong. Since type systems ensure that all subterms of a term do not go wrong, we could hope that the following conjecture holds:

Conjecture 1 (Type soundness, 6) If ∅ ⊢ a : τ , there exists v such that a co ⇒ v.

We were able to prove this conjecture for some uninteresting but nonetheless non-normalizing type systems, such as simply-typed λ-calculus without recursive types, but with a predefined constant of type int → int that diverges when applied. However, the conjecture is false for simply-typed λ-calculus with recursive types, and probably for all type systems with a general fixpoint operator. Andrzej Filinski provided the following counterexample. Consider

Compiler correctness proofs

We now return to the original motivation of this work: proving that compilers preserve the semantics of source programs (including diverging ones), using big-step semantics. We demonstrate this approach on the compilation of callby-value λ-calculus down to a simple abstract machine.

e = v 1 . . . v n . . . e ⊢ x n ⇒ v n e ⊢ c ⇒ c e ⊢ λa ⇒ (λa)[e] e ⊢ a 1 ⇒ (λb)[e ′ ] e ⊢ a 2 ⇒ v 2 v 2 .e ′ ⊢ b ⇒ v e ⊢ a 1 a 2 ⇒ v e ⊢ a 1 ∞ ⇒ e ⊢ a 1 a 2 ∞ ⇒ e ⊢ a 1 ⇒ v e ⊢ a 2 ∞ ⇒ e ⊢ a 1 a 2 ∞ ⇒ e ⊢ a 1 ⇒ (λb)[e ′ ] e ⊢ a 2 ⇒ v v.e ′ ⊢ b ∞ ⇒ e ⊢ a 1 a 2 ∞ ⇒ e = v 1 . . . v n . . . e ⊢ x n co ⇒ v n e ⊢ c co ⇒ c e ⊢ λa co ⇒ (λa)[e] e ⊢ a 1 co ⇒ (λb)[e ′ ] e ⊢ a 2 co ⇒ v 2 v 2 .e ′ ⊢ b co ⇒ v e ⊢ a 1 a 2 co ⇒ v
We will not formally study these relations, but note that they enjoy the same properties as the environment-less relations studied in section 3.

The abstract machine and its compilation scheme

The abstract machine we use as target of compilation follows the call-by-value strategy and the "eval-apply" model [START_REF] Marlow | Making a fast curry: push/enter vs. eval/apply for higher-order languages[END_REF]. It is close in spirit to the SECD, CAM, FAM and CEK machines [START_REF] Landin | The mechanical evaluation of expressions[END_REF][START_REF] Cousineau | The categorical abstract machine[END_REF][START_REF] Cardelli | The functional abstract machine[END_REF][START_REF] Felleisen | Control operators, the SECD machine and the λcalculus[END_REF]. The machine state has three components: a code sequence, a stack and an environment. The syntax for these components is as follows.

Instructions:

I ::= Var(n) push the
Var(n), C S E C V n .S E if E = V 1 . . . V n . . . Const(c), C S E C c.S E Clos(C ′ ), C S E C C ′ [E].S E App, C V.C ′ [E ′ ].S E C ′ (C, E).S V.E ′ Ret, C V.(C ′ , E ′ ).S E C ′ V.S E ′
As in section The compilation scheme from terms to code is straightforward:

[[x n ]] = Var(n) [[c]] = Const(c) [[λa]] = Clos([[a]], Ret) [[a 1 a 2 ]] = [[a 1 ]], [[a 2 ]], App
The intended effect for the code [[a]] is to evaluate the term a and push its value at the top of the machine stack, leaving the rest of the stack and the environment unchanged.

Proofs of semantic preservation

We expect the compilation to abstract machine code to preserve the behaviour of the source term, in the following general sense. Consider a closed term a and start the abstract machine in the initial state corresponding to a. If a diverges, the machine should perform infinitely many transitions. If a evaluates to the value v, the machine should reach a final state corresponding to v in a finite number of transitions. Here, the initial state corresponding to a is [[a]]; ǫ; ǫ. The final state corresponding to the result value v is ǫ; [[v]].ǫ; ǫ, that is, the code has been entirely consumed and the machine value [[v]] corresponding to the source-level value v is left on top of the stack. The correspondence between source-level values and machine values, as well as between sourcelevel environments and machine environments, is defined by:

[[c]] = c [[(λa)[e]]] = ([[a]], Ret)[[[e]]] [[v 1 . . . v n ]] = [[v 1 ]] . . . [[v n ]]
Semantic preservation is easy to show for terminating terms a using the bigstep semantics. We just need to strengthen the statement of preservation so that it lends itself to induction over the derivation of e ⊢ a ⇒ v. not possible to invoke the coinduction hypothesis to reason over the execution of [[a 1 ]], because this use of the coinduction hypothesis is not guarded by an inference rule for the ∞ → relation, or in other terms because no machine instruction is executed before invoking the hypothesis. In the approach to coinduction based on systems of equations presented in section 2.2, the problem manifests itself as a non-guarded equation x j = x j ′ when j is the judgment ([[a There are two ways to address this issue. The first is to modify the compilation scheme for applications, in order to insert a "no operation" instruction in front of the generated sequence: Of course, it is inelegant to pepper the generated code with Nop instructions just to make one proof go through. We therefore use an alternate approach where the compilation scheme for applications is unchanged, but we exploit the fact that the number of such recursive calls that do not perform a machine transition is necessarily finite, because our term algebra is finite. More precisely, this number is the left application height a of the term a being compiled, where a is defined by a 1 a 2 = a 1 + 1

[[a 1 a 2 ]] = Nop, [[a 1 ]], [[a 2 ]].
x = c = λa = 0

To prove theorem 52, we follow the approach described by Bertot [START_REF] Bertot | Filters on coinductive streams, an application to Eratosthenes' sieve[END_REF] in his coinductive presentation and proof of Eratosthenes' sieve algorithm. We first define the coinductive relation If n drops to zero, one or several transitions must be performed (rule mantics and applied it to the call-by-value λ-calculus [START_REF] Cousot | Bi-inductive structural semantics[END_REF]. Bi-inductive semantics are defined in terms of smallest fixed points with respect to a nonstandard ordering. This approach captures both terminating and diverging executions using a common set of inference rules. For instance, in the case of the call-byvalue λ-calculus, a single inference rule replaces the two rules (⇒-app) and ( ∞ ⇒-app-f) of our presentation. It is not entirely clear yet how the bi-inductive approach could be mechanized in a proof assistant. Another difference with the present article is that Cousot and Cousot [START_REF] Cousot | Bi-inductive structural semantics[END_REF] start from a big-step trace semantics, then systematically derive the other semantics (big-step and smallstep) by abstraction: this is an interesting alternative to our approach that separately deals with each semantics.

Gunter and Rémy [START_REF] Gunter | A proof-theoretic assessment of runtime type errors[END_REF] and Stoughton [START_REF] Stoughton | An operational semantics framework supporting the incremental construction of derivation trees[END_REF] have the same initial goal as us, namely describe both terminating and diverging computations with big-step semantics, but use increasing sequences of finite, incomplete derivations to do so, instead of infinite derivations. We do not know yet how their approach relates to our ∞ ⇒ and co ⇒ relations.

Milner and Tofte [START_REF] Milner | Co-induction in relational semantics[END_REF] and later Leroy and Rouaix [START_REF] Leroy | Security properties of typed applets[END_REF] used coinduction in the context of big-step semantics for functional and imperative languages, not to describe diverging evaluations, but to capture safety properties over possibly cyclic memory stores.

Of course, coinductive techniques are routinely used in the context of smallstep semantics, especially for the labeled transition systems arising from process calculi. The flavours of coinduction used there, especially proofs by bisimulations, are quite different from the present work. These techniques closely resemble the way coinduction can be used for defining the contextual equivalence in an operational setting [START_REF] Pitts | Operationally-based theories of program equivalence[END_REF] and the approximation order in the recursively defined domains involved in denotational semantics [START_REF] Pitts | A co-induction principle for recursively defined domains[END_REF].

The infinitary λ-calculus [START_REF] Kennaway | Infinitary lambda calculus[END_REF][START_REF] Berarducci | Infinite lambda-calculus and types[END_REF] studies diverging computations from a very different angle: not only the authors use reduction semantics, but their terms are also infinite, and they use topological techniques (metrics, convergence, etc) instead of coinduction.

Conclusions

We investigated two coinductive approaches to giving big-step semantics for non-terminating computations. The first, based on [START_REF] Cousot | Inductive definitions, semantics and abstract interpretation[END_REF] and using separate evaluation rules for terminating terms and diverging terms, appears very wellbehaved: it corresponds exactly to finite and infinite reduction sequences, and lends itself well to type soundness proofs and to compiler correctness proofs.

The second approach, consisting in a coinductive interpretation of the standard evaluation rules, is less satisfactory: while amenable to compiler correctness proofs as well, it captures only a subset of the diverging computations of interest -and it is not yet clear which subset exactly.

To evaluate the applicability of the coinductive techniques presented here to languages other than small functional languages, we developed coinductive big-step semantics for three low-level imperative languages used in the Compcert verified compiler [START_REF] Leroy | The Compcert verified compiler: commented Coq development[END_REF]: the source language Clight (a large subset of the C language) and the two intermediate languages C#minor and Cminor. These semantics characterize non-terminating programs and the traces of input/output events they perform. These semantics were used to mechanically prove that the first four passes of the Compcert compiler preserve the semantics of diverging programs. Some of the proofs use techniques similar to those presented in section 9.3 to combine co-inductive and inductive reasoning. The results of this experiment are encouraging. In particular, the addition of coinductive rules for divergence increases the size of the semantics by 40% only.

→

  b if and only if a * → b or a ∞ → . Proof (classical). For the "if" part, we show that a * → b =⇒ a co * → b by induction on a * → b, and that a ∞ → =⇒ a co * → b by coinduction. For the "only if" part, we show that a co * → b ∧ ¬(a * → b) =⇒ a ∞ → by coinduction. The result follows by excluded middle over a * → b. P

Lemma 10

 10 For all terms a, either a ∞ → , or there exists b such that a * → b and b →, that is, ∀b ′ , ¬(b → b ′ ). Proof (classical). We first show that ∀b, a * → b =⇒ ∃b ′ , b → b ′ implies a ∞ → by coinduction. We then argue by excluded middle on a

Lemma 13

 13 If D(a, r), then for all n, either C n (a) = ⊥ or C n (a) = r. Lemma 14 If r = ⊥ and C n (a) = r for some n, then D(a, r). Lemma 15 D(a, ⊥) if and only if C n (a) = ⊥ for all n.

  Proof (classical). By excluded middle, either ∀n, C n (a) = ⊥ or ∃n, C n (a) = ⊥. In the former case, we obviously have D(a, ⊥). In the latter case, pick n such that C n (a) = ⊥ and take r = C n (a). By lemma 14, we have D(a, r). P Lemma 17 If D(a, r 1 ) and D(a, r 2 ), then r 1 = r 2 .

  Finite traces:t ::= ǫ | a.t (inductive interpretation) Infinite traces: T ::= a.T (coinductive interpretation)

Lemma 20 a * →

 * b if and only if ∃t, a * → b / t. Proof. Straightforward by induction over the reduction sequences a * → b and a * → b / t. P Lemma 21 a ∞ → if and only if ∃T, a ∞ → / T .

∞ → implies a ∞→

 a / T (a). This follows by coinduction from the fact that T (a) = a.T (b) whenever a → b. P As a corollary, we obtain the following analogue of lemma 10. Lemma 22 For all terms a, either there exist a term b and a trace t such that a * → b / t and b →, or there exists an infinite trace T such that a ∞ → / T . Proof (classical). Follows from lemmas 10, 20 and 21. P

Lemma 25

 25 If a ∞ → / T and a * → b / t, there exists T ′ such that b ∞ → / T ′ and T = t.T ′ .

  and (2) a ⇒ v / a.t if a → b and b ⇒ v / t. The result follows by induction on the derivation of a * We first show by induction on a that a ∞ ⇒ / T implies the existence of b and T ′ such that a → b and b ∞ ⇒ / T ′ and T ∼ = a.T ′ . We then define the following variant ∞, ∼ = -→ of the infinite reduction predicate, by the coinductive inference rule a → b b

  ) If a ∈ Values and b * → b ′ / t, then there exists T ′ such that a b ′ ∞ → / T ′ and T = (a t).T ′ . Proof. For (1) and (2), we show by coinduction that a b ∞ → / T ′ b and a b ∞ → / a T ′ , respectively, then conclude by lemma 24. Property (3) follows from the decomposition lemma 25 and the fact that a b * → a ′ b / t b whenever a * → a ′ / t. Similarly, property (4) follows from the decomposition lemma 25 and the fact that a b * → a b ′ / a t if a ∈ Values and b * → b ′ / t. P Theorem 31 a ∞ → / T implies a ∞ ⇒ / T .

1 ) a 1 ∞→ / T 1 . This implies a 1 ∞⇒ / T 1 2 ∞→ / T 2 . 2 ∞→ 2 ∞→

 111112222 by coinduction hypothesis. Moreover, we have T ∼ = T 1 a 2 by case (1) of lemma 30, which implies the expected result by rule ( ∞ ⇒-app-l).(2) a 1 * → v / t 1 and v → and a By case (3) of lemma 30, we have v a / T ′ for some T ′ such that T = (t 1 a 2 ).T ′ . This implies that v ∈ Values. Moreover, T ′ ∼ = v T 2 by case (2) of lemma 30. Theorem 27 gives a 1 ⇒ v / t and the coinduction hypothesis gives a 2 ∞ ⇒ T 2 . The result follows from rule ( ∞ ⇒-app-r).(3) a 1 * → v 1 / t 1 and v 1 → and a 2 * → v 2 / t 2 and v 2 →. Using cases (3) and (4) of lemma 30, it follows that v 1 = λx.b for some x, b, that v 2 ∈ Values, and that (λx.b) v / T ′ for some T ′ such that T = (t 1 a 2 ).((λx.b) t 2 ).T ′ . By inversion, we deduce b[x ← v 2 ] ∞ → / T 3 for some T 3 such that T ′ ∼ = ((λx.b) v 2 ).T 3 . The result follows by rule ( ∞ ⇒-app-f), the coinduction hypothesis, and theorem 27.

Lemma 32

 32 If a ⇒ v, then a co ⇒ v. Proof. By induction on the derivation of a ⇒ v. P Lemma 33 ω co ⇒ v for all terms v. Proof. By coinduction, using rule ( co ⇒-app) with the coinduction hypothesis as third premise. P Naively, we could expect that co ⇒ is equivalent to the union of the ⇒ and ∞ ⇒ relations. This equivalence holds in one direction only, from coevaluation to evaluation. Lemma 34 If a co ⇒ v, then either a ⇒ v or a ∞ ⇒ . Proof (classical). We show that a co ⇒ v and ¬(a ⇒ v) implies a ∞ ⇒ . The result then follows by excluded middle on a ⇒ v. The auxiliary property is proved by coinduction and case analysis on a. The cases for variables, constants and abstractions trivially contradict one of the hypotheses. If a = a 1 a 2 , an inversion on the hypothesis a co ⇒ v shows that a 1 co ⇒ λx.b and a 2 co ⇒ v 2 and b

co ⇒ v

 v =⇒ a ∈ Values ∨ ∃b, a → b ∧ b co ⇒ v by induction on a. The result follows by coinduction. P The reverse implication obviously does not hold for terms a that diverge but do not coevaluate, such as the term a = ω (0 0) mentioned previously: if a ∞ ⇒ , we have a ∞ → and therefore a co * → v for any v, but a co ⇒ v does not hold. Another counterexample to the reverse implication is a = (λx. 0) ω and v = 1. Since a ∞ → , we have a co * → v. However, a co ⇒ v does not hold since the only term to which a coevaluates is 0.

Lemma 37

 37 If a ∈ Atoms and b ∈ CPS-terms, then b[x ← a] ∈ CPS-terms. Consequently, the value of a CPS term is an atom. Lemma 38 If b ∈ CPS-terms and b ⇒ v, then v ∈ Atoms. As a corollary, if b ∈ CPS-terms and b ⇒ λx.b ′ , then b ′ ∈ CPS-terms.

Lemma 40

 40 Define Ω = λx.ω. If b ∈ CPS-terms, b is closed and b ∞ ⇒ , then b co ⇒ Ω. Proof. By coinduction. The CPS term b cannot be an atom (this would contradict the divergence hypothesis), therefore b = b ′ a with b ′ a closed CPS term and a a closed CPS atom. Analysis on the last rule used in the derivation of b ∞ ⇒ reveals three cases. In the first case, b ′ ∞ ⇒ . By coinduction hypothesis, b ′ co ⇒ Ω = λx.ω. By lemmas 39 and 32, a co ⇒ a. Finally, ω[x ← a] = ω coevaluates to Ω by lemma 33. Applying rule ( co ⇒-app), it follows that b co ⇒ Ω. The second case, a ∞ ⇒ , is impossible by lemma 39. This leaves the third case: b ′ ⇒ λx.b ′′ and a ⇒ v and b ′′ [x ← v] ∞ ⇒ . By lemma 38, b ′′ is a CPS term. By lemma 39, v = a and therefore v is a CPS atom. It follows that b ′′ [x ← v] is a CPS term (lemma 37). Moreover, this term is closed because of the usual properties of free variables w.r.t. evaluation and substitution. Using lemma 32 and the coinduction hypothesis, we obtain b ′ co ⇒ λx.b ′′ and a co ⇒ v and b ′′ [x ← v] co ⇒ Ω, from which b co ⇒ Ω follows by rule ( co ⇒-app). P The claimed equivalence result follows as a corollary. Theorem 41 Let b be a closed CPS term. We have ∃v, b co ⇒ v if and only if b ∞ ⇒ or ∃v, b ⇒ v. Proof. Follows from lemmas 32, 34 and 40. P 8 Type soundness proofs

  Lemma 42 (Preservation) If a → b and ∅ ⊢ a : τ , then ∅ ⊢ b : τ Lemma 43 (Progress) If ∅ ⊢ a : τ , then either a ∈ Values or there exists b such that a → b. The formal statement of type soundness in Felleisen and Wright's approach is the following: Theorem 44 (Type soundness, 1) If ∅ ⊢ a : τ and a * → b, then either b ∈ Values or b reduces.

Theorem 45 (→ 8 . 2

 4582 Type soundness, 2) If ∅ ⊢ a : τ , then either a ∞ → , or there exists v such that a * → v and v ∈ Values. Proof (classical). By lemma 10, either a ∞ → or ∃b, a * → b ∧ b →. The result is obvious in the first case. In the second case, we note that ∅ ⊢ b : τ as a consequence of the preservation lemma, then use the progress lemma to conclude that b ∈ Values. P An alternate, equivalent formulation of this theorem uses the coreduction relation co * →. Theorem 46 (Type soundness, 3) If ∅ ⊢ a : τ , then there exists v such that a co * → v and v ∈ Values.Proof. Follows from theorem 45 and lemma 8. P An arguably nicer characterisation of "programs that do not go wrong" is given by the relation a safe → (read: "a reduces safely"), defined coinductively by the following rules:These rules are interpreted coinductively so that a safe → holds if a reduces infinitely. We can then state and show type soundness without recourse to classical logic:Theorem 47 (Type soundness, 4) If ∅ ⊢ a : τ , then a safe → .Proof. By coinduction. Applying the progress lemma, either a ∈ Values and we are done, or a → b for some b. In the latter case, ∅ ⊢ b : τ by the preservation property, and the result follows from the coinduction hypothesis.P Type soundness proofs using big-step semantics

F

  = λf.λx. (λg.λy. g y) (f x) or, in more readable ML notation let rec f x = (let g = f x in fun y -> g y) in f 0 The term Y F 0 is well-typed with type τ → τ ′ , yet it fails to coevaluate: the only possible value v such that Y F 0 co ⇒ v would be an infinite term, λy. (λy. (λy. . . . y) y) y.

9. 1

 1 Big-step semantics with environments and closuresOur abstract machine uses closures and environments indexed by de Bruijn indices. It is therefore convenient to reformulate the big-step evaluation predicates in these terms. Variables, written x n , are now identified by their de Bruijn indices n. Values (which are no longer a subset of terms) and environments are defined as: Values: v ::= c integer values | (λa)[e] function closures Environments: e ::= ǫ | v.e sequences of values As in section 3, we define three evaluation relations by the inference rules given below. e ⊢ a ⇒ v finite evaluations (inductive) e ⊢ a ∞ ⇒ infinite evaluations (coinductive) e ⊢ a co ⇒ v coevaluations (coinductive)

  value of variable number n | Const(c) push the constant c | Clos(C) push a closure for code C | App perform a function application | Ret return to calling function Code: C ::= ǫ | I, C instruction sequences Values: V ::= c constant values | C[E] code closures Environments: E ::= ǫ | V.E Stacks: S ::= ǫ empty stack | V.S pushing a value | (C, E).S pushing a return frame The behaviour of the abstract machine is defined as a transition relation C; S; E → C ′ ; S ′ ; E ′ that relates the machine states (C; S; E) and (C ′ ; S ′ ; E ′ ) respectively before and after the execution of the first instruction of the code C. The transitions are as follows.

Theorem 51

 51 If e ⊢ a ⇒ v, then ([[a]], C); S; [[e]] + → C; [[v]].S; [[e]] for all codes C and stacks S.

1 a 2

 2 ]], C); S; [[e]] ∞ → associated with the state e ⊢ a 1 a 2 co ⇒ v, C and S, while j ′ is the equivalent judgment ([[a 1 ]], ([[a 2 ]], App, C)); S; [[e]] ∞ → associated with the state e ⊢ a 1 co ⇒ v, ([[a 2 ]], App, C) and S.

  The Nop operation has the obvious machine transition (Nop, C); S; E → C; S; E. With this modification, the coinductive proof for lemma 52 performs a Nop transition before invoking the coinduction hypothesis to deal with the evaluation of [[a 1 ]]. This makes the coinductive proof properly guarded.

→

  C ′ ; S ′ ; E ′ C ′ ; S ′ ; E ′ ∞→ but allows the abstract machine to remain in the same state, not performing any transitions, for at most n steps (rule

  by definition and monotonicity of C, and the result follows.P ⊥ by induction over n and case analysis on the last rule used in the derivation of a

	Theorem 19 a
	Proof. For the "only if" part, we show that a

∞

⇒ if and only if D(a, ⊥).

∞ ⇒ implies C n (a) =

  4, we consider the following closures of the one-step transition relation: ′ ; S ′ ; E ′ one or several transitions (inductive)

	C; S; E	* → C ′ ; S ′ ; E ′ zero, one or several transitions (inductive)
	C; S; E C; S; E	∞ →	infinitely many transitions (coinductive)
	C; S; E	co * → C ′ ; S ′ ; E ′ zero, one, several or infinitely many
			transitions (coinductive)

+

→ C

The Coq development does not treat terms modulo α-conversion, therefore the substitution a[x ← b] can capture variables. However, it is capture-avoiding if b is closed, and this suffices to define evaluation and reduction of closed source terms.

Throughout this article, double horizontal lines in inference rules denote inference rules that are to be interpreted coinductively; single horizontal lines denote the inductive interpretation.

Acknowledgments

Andrzej Filinski disproved the conjecture from section 8.2 very shortly after it was stated. We thank Eduardo Bonelli, the anonymous reviewers for the ESOP 2006 conference, the participants of the 22nd meeting of IFIP Working Group 2.8 (Functional Programming), and the anonymous reviewers of this special issue for their feedback.

fully satisfactory for two reasons: (1) extra rules must be provided to define a ⇒ err, which increases the size of the semantics; [START_REF] Plotkin | A structural approach to operational semantics[END_REF] there is a risk that the rules for a ⇒ err are incomplete and miss some cases of "going wrong", in which case the type soundness statement does not guarantee that well-typed terms either evaluate to a value or diverge.

Let us revisit these trade-offs in the light of our characterizations of divergence and coevaluation. We can now formally state what it means for a term to evaluate or to diverge. This leads to the following alternate statement of type soundness:

Theorem 49 (Type soundness, 5) If ∅ ⊢ a : τ , then either a ∞ ⇒ or there exists v such that a ⇒ v.

By excluded middle, either ∃v. a ⇒ v or ∀v, ¬(a ⇒ v). Theorem 49 therefore follows from lemma 50 below, which is a big-step analogue to the progress lemma.

Lemma 50 (Progress, big-step style) If ∅ ⊢ a : τ and ∀v, ¬(a ⇒ v), then a ∞ ⇒ .

Proof (classical). The proof is by coinduction and case analysis over a. The cases a = x, a = c and a = λx.b lead to contradictions: variables have no types in the empty environment; constants and abstractions evaluate to themselves. The interesting case is therefore a = a 1 a 2 . By excluded middle, either a 1 evaluates to some value v 1 , or not. In the latter case, a ∞ ⇒ follows from rule ( ∞ ⇒-app-l) and from a 1 ∞ ⇒ , which we obtain by coinduction hypothesis. In the former case, v 1 has a function type τ ′ → τ by lemma 48, and therefore v 1 = λx.b for some x and b. Moreover, {x : τ ′ } ⊢ b : τ . Using excluded middle again, either a 2 evaluates to some value v 2 , or not. In the latter case, a ∞ ⇒ follows from rule ( ∞ ⇒-app-r) and the coinduction hypothesis. In the former case, ∅ ⊢ v 2 : τ ′ . Since typing is stable by substitution, ∅ ⊢ b[x ← v 2 ] : τ . Using excluded middle for the third time, it must be that ∀v. ¬(b[x ← v 2 ] ⇒ v), otherwise a would evaluate to some value. The result a ∞ ⇒ then follows from rule ( ∞ ⇒-app-f) and the coinduction hypothesis. P

The proof above is an original alternative to the standard approach of showing ¬(a ⇒ err) for all well-typed terms a. From a methodological standpoint, our proof addresses one of the shortcomings of the standard approach, namely the risk of not putting in enough error rules. If we forget some divergence rules, the proof of lemma 50 will, in all likelihood, not go through. Therefore, this novel approach to proving type soundness using big-step semantics appears rather robust with respect to mistakes in the specification of the semantics.

The other methodological shortcoming remains, however: just like the "not goes wrong" approach, our approach requires more evaluation rules than just Proof. By induction on the derivation of e ⊢ a ⇒ v. The base cases where a is a variable, a constant or an abstraction are straightforward. The inductive case is a = a 1 a 2 with e ⊢ a 1 ⇒ (λb)[e ′ ] and e ⊢ a 2 ⇒ v 2 and v 2 .e ′ ⊢ b ⇒ v.

We build the following sequence of machine transitions:

(induction hypothesis applied to the evaluation of a 1 )

(induction hypothesis applied to the evaluation of a 2 )

(induction hypothesis applied to the evaluation of b)

The result follows by transitivity of +

→. P

It is impossible, however, to prove semantic preservation for diverging terms using only the standard big-step semantics, since it does not describe divergence. This led several authors to prove semantic preservation for compilation to abstract machines using small-step semantics with explicit substitutions [START_REF] Rittri | Proving the correctness of a virtual machine by a bisimulation[END_REF][START_REF] Hardin | Functional runtimes within the lambdasigma calculus[END_REF]. To this end, they prove a simulation result between machine transitions and source-level reductions: every machine transition corresponds to zero or one source-level reductions. To make the correspondence precise, they need to define a decompilation relation that maps intermediate machine states back to source-level terms. However, decompilation relations are difficult to define, especially for optimizing compilation schemes; see [28, section 4.3] for an example.

The coinductive big-step semantics studied in this article provide a simpler way to prove semantic preservation for non-terminating terms. Namely, the following two theorems hold, showing that compilation preserves divergence and coevaluation as characterized by the Both theorems cannot be proved directly by coinduction and case analysis over a. The problem is in the application case a = a 1 a 2 , where the code component of the initial machine state is of the form

In exchange for performing at least one transition, the count n can be reset to any value n ′ , allowing an arbitrary but finite number of non-transitions to be taken afterwards.

A proof by coinduction shows the following variant of theorem 52, using Theorem 52 then follows from lemmas 54 and 55. We omit the proof of theorem 53, which is similar.

Related work

There are few instances of coinductive definitions and proofs for big-step semantics in the literature. Cousot and Cousot [START_REF] Cousot | Inductive definitions, semantics and abstract interpretation[END_REF] proposed the coinductive big-step characterization of divergence that we use in this article and studied its applicability for abstract interpretation, as pursued later by Schmidt [START_REF] Schmidt | Trace-based abstract interpretation of operational semantics[END_REF]. This approach was applied to call-by-name λ-calculus by Hughes and Moran [START_REF] Hughes | Making choices lazily, in: Functional Programming Languages and Computer Architecture[END_REF] and by Crole [START_REF] Crole | [END_REF], and to call-by-value λ-calculus by Grall [START_REF] Grall | Deux critères de sécurité pour l'exécution de code mobile[END_REF].

Following up on [START_REF] Cousot | Inductive definitions, semantics and abstract interpretation[END_REF], Cousot and Cousot recently introduced bi-inductive se-