Cslib.LambdaCalculus.Named.Term
inductiveimported Lean
Syntax of terms.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in variable {Var : Type u} in inductive Cslib.LambdaCalculus.Named.Term (Var : Type u) : Type u
- Defined in
- CSLib, `Cslib.LambdaCalculus.Named.Term`
- Lean proof
- By Fabrizio Montesi, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Fabrizio Montesi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.LambdaCalculus.Named.Term← Cslib.LambdaCalculus.Named.Term (Cslib/Languages/LambdaCalculus/Named/Untyped/Basic.lean:34): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 6
- Cslib.LambdaCalculus.Named.Term.bvBound variables.
- Cslib.LambdaCalculus.Named.Term.varsVariable names (free and bound) in a term.
- Cslib.LambdaCalculus.Named.Term.SubstCapture-avoiding substitution, as an inference system.
- Cslib.LambdaCalculus.Named.Term.fvFree variables.
- Cslib.LambdaCalculus.Named.Term.rename.eq_sizeOfRenaming preserves size.
- Cslib.LambdaCalculus.Named.Term.renameRenaming, or variable substitution.
m.rename x yrenamesxintoyinm.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in variable {Var : Type u} in /-- Syntax of terms. -/ inductive Cslib.LambdaCalculus.Named.Term (Var : Type u) : Type u where | var (x : Var) | abs (x : Var) (m : Term Var) | app (m n : Term Var) deriving DecidableEq