Work

Substitution without copy and paste

Type: conference-paper

Abstract: Defining substitution for a language with binders like the simply typed $\lambda$-calculus requires repetition, defining substitution and renaming separately. To verify the categorical properties of this calculus, we must repeat the same argument many times. We present a lightweight method that avoids repetition and that gives rise to a simply typed category with families (CwF) isomorphic to the initial simply typed CwF. Our paper is a literate Agda script.

Source: Repository@Nottingham (University of Nottingham)

Authors: Altenkirch, Thorsten, Burke, Nathaniel, Wadler, Philip

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7025123531

Cites:

Cited by:

Related to: