Interpreting η-conversion as an expansion rule in the simply-typed λ-calculus maintains the
confluence of reduction in a richer type structure. This use of expansions is supported by …

The meaning of programs in a language with implicit overloading can be described by
translating them into a second language that makes the use of overloading explicit. A single …

Rewriting systems can be modelled categorically by representing terms as morphisms and
reduction by an order on the homsets. Confluence of the system, and hence of the homset …

The ML type system was originally introduced as a means of identifying a class of terms in a
simple untyped language, often referred to as core-ML, whose evaluation could be …

This work demonstrates industrial-strength categorical programs can be computed
applicatively using only a category's commutative diagrams for reduction. Categorical initial …

Formal software development demands a broad range of logics, specification languages
and programming languages. A'logical framework'to support the definition and use of such …

The meaning of programs in a language with implicit overloading can be described by
translating them into a second language that makes the use of overloading explicit. A single …

Abstract îj-conversion and surjective pairing can be treated as expansion rules in the simply-
typed Л-calculus with terminal object, surjective pairing and iterator, to obtain a fully …