scrambled
Home//Concepts/Partiality
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

Partiality

Modified just now
Books
  • Chapter 5. Types
JourneyProgramming Language Theory Statusreviewing Tags
  • computation theory
  • semantics
  • set-theory-relation

The property of a computation that may not terminate or produce a result for all inputs. Partial functions are undefined for some inputs, unlike Total functions which always return a value.

Previous in ConceptsPartial orderNext in Concepts Pattern
Books
  • Chapter 5. Types
JourneyProgramming Language Theory
Statusreviewing
Tags
  • computation theory
  • semantics
  • set-theory-relation