In this paper, we study strong normalization of a core language based on System F-omega
which supports programming with finite and infinite structures. Building on our prior work …

In this paper, we study strong normalization of a core language based on System is general
enough that it can be the target of compilation for the Calculus of Constructions, this work is …

Term rewriting systems play an important role in many areas of computer science. In
essence, they provide an abstract way to define algorithms. The theory is simple: terms …

Sized types have been developed to make termination checking more perspicuous, more
powerful, and more modular by integrating termination into type checking. In dependently …

Type-based termination is a semantically intuitive method that ensures termination of
recursive definitions by tracking the size of datatype elements, and by checking that …

This paper aims at carrying out termination proofs for simply typed higher-order calculi
automatically by using ordering comparisons. To this end, we introduce the computability …

In this paper, we show how to extend the notion of reducibility introduced by Girard for
proving the termination of β-reduction in the polymorphic λ-calculus, to prove the termination …

When enriching the lambda-calculus with rewriting, union types may be needed to type all
strongly normalizing terms. However, with rewriting, the elimination rule (orE) of union types …

We use the framework of biorthogonality to introduce a novel semantic definition of the
concept of barb (basic observable) for process calculi. We develop a uniform basic theory of …

Proof assistants based on dependent type theory are gaining adoption as a tool to develop
certified programs. A successful example is the Coq proof assistant, an implementation of a …