### Abstract

I formalise a Church-style simply-typed \(\lambda\)-calculus, extended with pairs, a unit value, and projection functions, and show some metatheory of the calculus, such as the subject reduction property. Particular attention is paid to the treatment of names in the calculus. A nominal style of binding is used, but I use a manual approach over Nominal Isabelle in order to extract an executable type inference algorithm. More information can be found in my undergraduate dissertation.

### License

BSD License

### Topics

- Computer science/Programming languages/Type systems

### Session Name_Carrying_Type_Inference

- Fresh
- Permutation
- PreSimplyTyped
- SimplyTyped

## Cite

×

Name_Carrying_Type_Inference-AFP

    @article{Name_Carrying_Type_Inference-AFP,
      author  = {Michael Rawson},
      title   = {Verified Metatheory and Type Inference for a Name-Carrying Simply-Typed Lambda Calculus},
      journal = {Archive of Formal Proofs},
      month   = {July},
      year    = {2017},
      note    = {\url{https://isa-afp.org/entries/Name_Carrying_Type_Inference.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Jul 15, 2017 : Isabelle2016-1