Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/migamake/json-autotype
Automatic Haskell type inference from JSON input
https://github.com/migamake/json-autotype
elm hackage hacktoberfest2019 haskell inference json json-autotype parse parser unification union
Last synced: 4 days ago
JSON representation
Automatic Haskell type inference from JSON input
- Host: GitHub
- URL: https://github.com/migamake/json-autotype
- Owner: migamake
- Created: 2014-05-01T07:52:05.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2023-09-21T00:08:59.000Z (about 1 year ago)
- Last Synced: 2024-10-30T00:34:12.920Z (7 days ago)
- Topics: elm, hackage, hacktoberfest2019, haskell, inference, json, json-autotype, parse, parser, unification, union
- Language: Haskell
- Size: 902 KB
- Stars: 150
- Watchers: 8
- Forks: 23
- Open Issues: 13
-
Metadata Files:
- Readme: README.md
- Changelog: changelog.md
Awesome Lists containing this project
README
json-autotype
=============
Takes a JSON format input, and generates automatic Haskell type declarations.
Parser and printer instances are derived using [Aeson](http://hackage.haskell.org/package/aeson).
The program uses union type unification to trim output declarations. The types of same attribute tag and similar attribute set, are automatically unified using recognition by attribute set matching. (This option can be optionally turned off, or a set of unified types may be given explicitly.) `:|:` alternatives (similar to `Either`) are used to assure that all `JSON` inputs seen in example input file are handled correctly.
I should probably write a short paper to explain the methodology.
[](https://gitlab.com/migamake/json-autotype/commits/master)
[](https://hackage.haskell.org/package/json-autotype)
[](http://packdeps.haskellers.com/feed?needle=json-autotype)
[](https://hub.docker.com/r/migamake/json-autotype/)
[](https://hub.docker.com/r/migamake/json-autotype/)
Details on official releases are on [Hackage](https://hackage.haskell.org/package/json-autotype)
We currently support code generation to [Haskell](https://www.haskell.org), and [Elm](https://elm-lang.org).
_Please [volunteer help](https://gitter.im/dataHaskell/json-autotype) or [provide financial support](https://paypal.me/MichalJan), if you want your favourite language supported too!_
Expression of interest in particular feature may be filed as [GitHub issue](https://github.com/mgajda/json-autotype/issues/new).
USAGE:
======
After installing with `cabal install json-autotype`, you might generate stub code for the parser:
```
json-autotype input1.json ... inputN.json -o MyFormat.hs
```
Then you might test the parser by running it on an input file:
```
runghc MyFormat.hs input.json
```
At this point you may see data structure generated automatically for you.
The more input files you give to the inference engine `json-autotype`,
the more precise type description will be.
Algorithm will also suggest which types look similar, based on a set of attribute names,
and unify them unless specifically instructed otherwise.
The goal of this program is to make it easy for users of big JSON APIs to generate entries from
example data.
Occasionally you might find a valid JSON for which `json-autotype` doesn't generate a correct parser.
You may either edit the resulting file _and_ send it to the author as a test case for future release.
Patches and suggestions are welcome.
You can run [with Docker](https://hub.docker.com/r/migamake/json-autotype/):
```
docker run -it migamake/json-autotype
```
EXAMPLES:
=========
The most simple example:
```
{
"colorsArray":[{
"colorName":"red",
"hexValue":"#f00"
},
{
"colorName":"green",
"hexValue":"#0f0"
},
{
"colorName":"blue",
"hexValue":"#00f"
}
]
}
```
It will produce the module with the following datatypes and TH calls for JSON parser derivations:
```
data ColorsArray = ColorsArray {
colorsArrayHexValue :: Text,
colorsArrayColorName :: Text
} deriving (Show,Eq)
data TopLevel = TopLevel {
topLevelColorsArray :: ColorsArray
} deriving (Show,Eq)
```
Note that attribute names match the names of JSON dictionary keys.
Another example with ambiguous types:
```
{
"parameter":[{
"parameterName":"apiVersion",
"parameterValue":1
},
{
"parameterName":"failOnWarnings",
"parameterValue":false
},
{
"parameterName":"caller",
"parameterValue":"site API"
}]
}
```
It will produce quite intuitive result (plus extra parentheses, and class derivations):
```
data Parameter = Parameter {
parameterParameterValue :: Bool :|: Int :|: Text,
parameterParameterName :: Text
}
data TopLevel = TopLevel {
topLevelParameter :: Parameter
}
```
Real-world use case examples are provided in the package [source repository](https://github.com/mgajda/json-autotype/tree/master/test).
Methodology:
============
1. JSON-Autotype uses its own [union type system](https://github.com/mgajda/json-autotype/blob/master/Data/Aeson/AutoType/Type.hs) to derive types from JSON documents as the first step.
2. Then it finds all those records that have 90% of the same key names, and suggest them as similar enough to merit treating as instances of the same type. (Note that this is optional, and can be tuned manually.)
3. Last step is to derive unique-ish type names - we currently do it by concatenating the name of the container and name of the key. (Please open PR, if you want something fancy about that - initial version used just key name, when it was unique.)
4. Finally it generates [Haskell](https://www.haskell.org/) or [Elm](http://elm-lang.org/) code for the type.
Combination of robust [*union type system*](https://github.com/mgajda/json-autotype/blob/master/Data/Aeson/AutoType/Type.hs), and heuristic makes this system extremely reliable.
Main test is QuickCheck-based generation of random JSON documents, and checking that they are all correctly parsed by resulting parser.
More details are described in [Haskell.SG meetup presentation](https://engineers.sg/video/json-autotype-1-0-haskell-sg--429).
Other approaches:
=================
* There is a [TypeScript type provider](https://jvilk.com/MakeTypes/), and [PLDI 2016 paper](https://dl.acm.org/citation.cfm?id=2908115) on solving this problem using preferred type shapes instead of union types.
One can think about it as a alternative theory that gives very similar results, with more complicated exposition. It also does not tackle the problem of tagged records. It also does not attempt to guess unification candidates in order to reduce type complexity.
* There *was* a [json-sampler](https://maxs.io/generating-types-from-json-samples/) that allows to make simpler data structure from JSON examples, but doesn't seem to perform unification, nor is it suitable for big APIs.
* [PADS project](https://www.cs.princeton.edu/~dpw/papers/padsml06.pdf) is another attempt to automatically infer types to treat arbitrary data formats (not just JSON). It mixes type declarations, with parsing/printing information in order to have a consistent view of both. It does not handle automatic type inference though.
* [JSON Schema generator](https://www.newtonsoft.com/jsonschema/help/html/GenerateSchema.htm) uses .NET types to generate JSON Schema instead (in opposite direction.) Similar schema generation is [used here](https://sixgun.wordpress.com/2012/02/09/using-json-net-to-generate-jsonschema/)
* Microsoft Developer Network advocates use of [Data Contracts](https://docs.microsoft.com/en-us/dotnet/framework/wcf/feature-details/using-data-contracts) instead to constrain possible input data.
* [QuickType](https://github.com/quicktype/quicktype) uses [Markov chains heuristic](https://blog.quicktype.io/markov/) instead of theory