Are you purposefully excluding all functional languages that disprove your theory? Scheme and Elixir to quote only two are clearly about functional programming and they're not about type theory or typed lambda calculus.
System F, QTT, CIC, LCF, ML are mathematical models and instances of a type system. I don't think scheme and erlang/elixir has the same foundational properities as the languages above. Scheme and erlang/elixir may have been inspired by some of them but never embraced them as the above programming languages do.
You're welcome to have another opinion. I have no intention of asserting mine over yours.
It's not an issue of convincing anyone. I'm trying to understand where you base your definition, as you're literally the only person I've ever read defining FP with this restrictive definition.
Labels are only useful when they have a shared meaning between people. You seem to be using FP with a meaning that's not shared by anyone.
It’s mostly due to the fact that they’re fundamentally imperative programmers.
You may think it’s restrictive but once you enter the world of type theory and its applications to computation the entire world of constructive mathematics, category theory, abstract algebra. homotopy theory, topology, etc. are just waiting to be applied to computations.
The meaning of FP is well known in academia and scattered groups of FP programmers.
Imperative programmers are mostly blind to FP. They only recognize FP by their cosmetic features.
Translation: you have none because that defintiion of yours isn't coming from academia at all. And you visibly prefer condescension to intellectual honesty.
0
u/dun-ado Jul 13 '22 edited Jul 13 '22
It’s probably wrong—I haven’t watched the video. It may be due to looking at FP by some of its surface features only.
I can only give you some examples:
System F underlies Haskell
Idris2 is a realization of Quantitative Type Theory (QTT)
Lean4 is based on Calculus of Inductive Constructions (CIC)
SML is based Logic of Computable Function (LCF)
OCaml extends ML and is a dialect of ML
F# is in the family of ML
ML is based on first order predicate logic and some extension of the simply typed lambda calculus