datafunctiontacit alternatives and similar packages
Based on the "Data" category.
Alternatively, view datafunctiontacit alternatives based on common mentions on social networks and blogs.

semanticsource
Parsing, analyzing, and comparing source code across many languages 
lens
Lenses, Folds, and Traversals  Join us on web.libera.chat #haskelllens 
text
Haskell library for space and timeefficient operations over Unicode text. 
codebuilder
Packages for defining APIs, running them, generating client code and documentation. 
unorderedcontainers
Efficient hashingbased container types 
compendiumclient
Mu (μ) is a purely functional framework for building micro services. 
massiv
Efficient Haskell Arrays featuring Parallel computation 
cassava
A CSV parsing and encoding library optimized for ease of use and high performance 
holmes
A reference library for constraintsolving with propagators and CDCL. 
hashable
A class for types that can be converted to a hash value 
resourcepool
A highperformance striped resource pooling implementation for Haskell 
binary
Efficient, pure binary serialisation using ByteStrings in Haskell. 
primitive
This package provides various primitive memoryrelated operations. 
jsonautotype
Automatic Haskell type inference from JSON input 
discrimination
Fast linear time sorting and discrimination for a large class of data types 
hashtables
Mutable hash tables for Haskell, in the ST monad 
audiovisual
Extensible records, variants, structs, effects, tangles 
reflection
Reifies arbitrary Haskell terms into types that can be reflected back into terms 
IORefCAS
A collection of different packages for CAS based data structures. 
dependentmap
Dependentlytyped finite maps (partial dependent products) 
dependentsum
Dependent sums and supporting typeclasses for comparing and displaying them 
streaming
An optimized general monad transformer for streaming applications, with a simple prelude of functions 
orgmodeparse
Attoparsec parser combinators for parsing orgmode structured text! 
bifunctors
Haskell 98 bifunctors, bifoldables and bitraversables 
texticu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text. 
protobuf
An implementation of Google's Protocol Buffers in Haskell. 
safecopy
An extension to Data.Serialize with builtin version control 
scientific
Arbitraryprecision floatingpoint numbers represented using scientific notation 
uuidtypes
A Haskell library for creating, printing and parsing UUIDs
Clean code begins in your IDE with SonarLint
Do you think we are missing an alternative of datafunctiontacit or a related project?
README
Data.Function.Tacit
Write functions in tacit (pointless) style using Applicative and De Bruijn index notation.
Examples:
\f x y > f x == f y = lurryA @N3 ((==) <$> (_1 <*> _2) (_1 <*> _3))
\f g x > f x (g x) = lurryA @N3 ((_1 <*> _3) <*> (_2 <*> _3))
\a b > b = lurryA @N2 _2
This module is intended to be used with Control.Applicative
but
does not export it.
Opposite to De Bruijn indices, this module orders the arguments
from the outsidein, rather than the insideout (or lefttoright
instead of righttoleft). For example, the conventional
λλλ3 1 (2 1)
is instead λλλ1 3 (2 3)
.
The first argument is z
, the second argument z.s
, the third
argument z.s.s
, and so on. For the first few arguments convenient
names have been defined, such as _1
, _2
, _3
, and so on.
To export a function use lurryA
. You must specify the arity of
the function, which is intended to be done with TypeApplications
(new in GHC 8.0). lurryA @(S Z) f
says the arity of @[email protected] is one,
lurryA @(S (S Z)) f
says the arity is two, and so on. For
convenience the first few Peano numbers have been given aliases,
such as N1
, N2
, N3
, and so on.
You can write all functions with <*>
and <$>
from
Applicative
— should be able to, yet unproven.
There is a type inference problem with functions where the highest
index does not match the function arity, such as const
. To
resolve this ambiguity you must give an explicit signature. For
example: lurryA @N2 (_1 :: (a, (b, c)) > a)
.
TODO:
 Construction rules for rewriting functions into this tacit form. More precise than just examples. Would demonstrate that any function can be written in this tacit form.
 An inverse for
lurry
,unlurry
. Type inference seems difficult.  Inference problem when the highest index does not match the function arity.
NOTES:
 The implementation would be simpler and less prone to inference
problems if GHC had closed classes. Given a type family
F
, a corresponding valuelevel implementation may exist forx > F x
. This implementation can be given by a class and an instance corresponding to each case in the type family. However, if the type family is closed and we only have open classes, we cannot always define corresponding instances which are unambiguous. An example of this correspondence isLurried
/Lurry
.