🔐 Login Required
Programming spectrum 1
Agent-oriented programming languages Array languages Aspect-oriented programming languages Assembly languages Authoring languages Command-line interface languages Compiled languages Concatenative programming languages Concurrent languages Constraint programming languages Curly-bracket languages Dataflow languages Data-oriented languages Decision table languages Declarative languages Embeddable languages In source code Server side Client side In object code Educational programming languages Esoteric languages Extension languages Fourth-generation languages Functional languages Pure Impure Hardware description languages HDLs for analog circuit design HDLs for digital circuit design Imperative languages Interactive mode languages Interpreted languages Iterative languages Languages by memory management type Garbage collected languages Languages with manual memory management Languages with partial manual memory management Languages with optional manual memory management Languages with deterministic memory management Languages with automatic reference counting (ARC) List-based languages – LISPs Little languages Logic-based languages Machine languages Macro languages Textual substitution macro languages Application macro languages Metaprogramming languages Multiparadigm languages Numerical analysis Non-English-based languages Object-oriented class-based languages Multiple dispatch Single dispatch Object-oriented prototype-based languages Off-side rule languages Procedural languages Query languages Reflective languages Rule-based languages Scripting languages Stack-based languages Synchronous languages Shading languages Real-time rendering Offline rendering Syntax-handling languages System languages Transformation languages Visual languages Wirth languages XML-based languages
https://en.m.wikipedia.org/wiki/Comparison_of_programming_languages
https://en.m.wikipedia.org/wiki/List_of_programming_languages_by_type
Functional languages employ a computational model based on the recursive definition of functions. They take their inspiration from the lambda calculus,a formal computational model developed by Alonzo Church
Dataflow languages model computation as the flow of information (tokens)among primitive functional nodes. They provide an inherently parallel model:nodes are triggered by the arrival of input tokens, and can operate concurrently.