scrambled
Home//Concepts/Involution
scrambled
Overviewjust now
154
2
4
1082
3
2
24
633
Dimensional inference rule formatjust nowAbstract binding graphjust nowAbstract binding tree abtjust nowAbstract binding tree abt valence abstractorjust nowAbstract data typejust now
408
11
4
Overviewjust now
154
2
4
1082
3
2
24
633
Dimensional inference rule formatjust nowAbstract binding graphjust nowAbstract binding tree abtjust nowAbstract binding tree abt valence abstractorjust nowAbstract data typejust now
408
11
4
Concept

Involution

Modified just now
Books
  • Chapter 1. Basics - functional programming in rocq
JourneyProgramming Language Theory Statusreviewing Tags
  • set-theory-relation

A function that is its own inverse, satisfying f(f(x)) = x (like negation on booleans or reversing a list twice).

A function that is its own inverse, satisfying f(f(x)) = x (like negation on booleans or reversing a list twice).

Previous in ConceptsIntuitionistic constructive logicNext in Concepts Involutive
Books
  • Chapter 1. Basics - functional programming in rocq
JourneyProgramming Language Theory
Statusreviewing
Tags
  • set-theory-relation