Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in functional-programming

Is there a Functional Programming library for .NET?

c# .net functional-programming

Applicative functors other than monads and ZipList?

haskell functional-programming

Is there any good example of use cases for angular.identity()?

javascript functional-programming angularjs

Is it possible that F# will be optimized more than other .Net languages in the future?

f# functional-programming parallel-processing vectorization

How do you curry the 2nd (or 3rd, 4th, ...) parameter in F# or any functional language?

f# functional-programming currying named-parameters

Using vs lambda [closed]

c# .net functional-programming

How to represent a simple finite state machine in Ocaml?

functional-programming ocaml state fsm

Is there anything like Haskell's 'maybe' function built into Scala?

scala functional-programming

Is `data PoE a = Empty | Pair a a` a monad?

haskell functional-programming monads

Scala fold right and fold left

scala functional-programming purely-functional foldleft

Map, Filter, Foldr in DrRacket/Scheme

filter functional-programming scheme fold map-function

Swift: What's the best way to pair up elements of an Array

arrays swift functional-programming immutability

Finding the subsets of an array in PHP

php arrays dependencies functional-programming subset

more elegant way to write if( list.nonEmpty) Some(list.max) else None?

scala functional-programming max scala-option

Check if an array of objects have a key value using underscore

javascript functional-programming underscore.js

Problems on migrating from functional to OO

scala haskell functional-programming oop

Scala Get First and Last elements of List using Pattern Matching

scala functional-programming pattern-matching

Cartesian product in clojure

clojure functional-programming cartesian-product

"int -> int -> int" What does this mean in F#?

f# functional-programming currying

How do I convert an inductive type into a coinductive type efficiently (without recursion)?

haskell recursion functional-programming induction coinduction
« Newer Entries Older Entries »