-
Notifications
You must be signed in to change notification settings - Fork 0
Functional
Аббас Гусенов edited this page Sep 17, 2025
·
2 revisions
- nealford.com • Functional Thinking
- My Setup by Oleksandr Manzyuk
- Algebras for the Masses!
- Материалы по дисциплинам, преподаваемым на кафедре ПОВТиАС БГТУ им. В.Г.Шухова
- Хабр
- Слово Божие — функциональное программирование как основа Вселенной (Сергей Шпадырев)
- Хабр / От Аристотеля до Тьюринга: что такое функциональное программирование и как оно облегчает жизнь
- The Ruliology of Lambdas by Stephen Wolfram
- Monads For The Rest Of Us
- r/scala / Seriously: What is the best explanation of Monads for people who can't grasp it?
- Becoming Functional by Joshua Backfield
- Functional Thinking by Neal Ford
- Learning Functional Programming by Jack Widman - 135 pages
- Introducing ReScript. Functional Programming for Web Applications by Danny Yang - 263 pages
- Категория:Общие понятия о функциях
- Functor (functional programming)
- Function object
- Combinator library is a software library which implements combinators for a functional programming language; "the key idea is this: a combinator library offers functions (the combinators) that combine functions together to make bigger functions".
- Cameleon (programming language) graphical language for functional programming
-
Function composition
- Композиция функций суперпозиция
- Map or mapping (mathematics) generalizations of the concept of function
- Functional predicate is a logical symbol that may be applied to an object term to produce another object term.
- Map (higher-order function) is the name of a higher-order function that applies a given function to each element of a collection, e.g. a list or set, returning the results in a collection of the same type.
- Higher-order function takes one or more functions as arguments AND/OR returns a function as its result
- Pure function is a computational analogue of a mathematical function.
- Idris (programming language) is a purely-functional programming language with dependent types, optional lazy evaluation, and features such as a totality checker.