Package maintainers and Hackage trustees are allowed to edit certain bits
of package metadata after a release, without uploading a new tarball.
Note that the tarball itself is never changed, just the metadata that is
stored separately. For more information about metadata revisions, please
refer to the
Hackage Metadata Revisions FAQ.
No. |
Time |
User |
SHA256 |
-r4 (exference-1.6.0.0-r4) |
2017-08-01T21:49:06Z |
lspitzner |
334ddeb8112ca62909d009f5324b159b35a4f7bad86d7f25469d2172d1152cfb
|
|
|
-r3 (exference-1.6.0.0-r3) |
2017-02-13T15:48:34Z |
lspitzner |
e3f9d32a394fc1790ce74c5a9ba629f97dbd3a11796d4ac1e5f642f76802cc56
|
|
Changed source-repository
from source-repository head
type: git
location: git@github.com:lspitzner/multistate.git
to source-repository head
type: git
location: git@github.com:lspitzner/exference.git
|
-r2 (exference-1.6.0.0-r2) |
2017-02-13T15:46:13Z |
lspitzner |
6da1fd19602e76b28cae7de791e967ed1d643b5345ab5a4405c13efea4c196f8
|
|
Changed source-repository
from source-repository head
type: git
location: git@github.com:lspitzner/exference.git
to source-repository head
type: git
location: git@github.com:lspitzner/multistate.git
Changed description
from Type inference takes an expression and tells you its type. This process
can be inversed: We recursively create random expression trees while checking
that they -so far- match a given input type. At each step we do the backwards
step of the inference algorithm step. If you are lucky, this search
yields one or more expressions.
Djinn is a similar tool that guarantees to always terminate. But the
cost of that property is that Djinn does not properly handle polymorphic
queries - and those are the interesting ones, really :)
Exference supports type classes, handles undeclared types well
(Foo -> Foo yields id for unknown Foo), does _not_ check kinds,
can pattern-match on newtypes, supports RankNTypes.
Exference reads an environment of function types, data types, type classes
and instances. The user can add to this environment, but keep in mind that
each addition enlarges the search space.
to Type inference takes an expression and tells you its type. This process
can be inversed: We recursively create random expression trees while checking
that they -so far- match a given input type. At each step we do the backwards
step of the inference algorithm step. If you are lucky, this search
yields one or more expressions.
Djinn is a similar tool that guarantees to always terminate. But the
cost of that property is that Djinn does not properly handle polymorphic
queries - and those are the interesting ones, really :)
Exference supports type classes, handles undeclared types well
(Foo -> Foo yields id for unknown Foo), does _not_ check kinds,
can pattern-match on newtypes, supports RankNTypes.
Exference reads an environment of function types, data types, type classes
and instances. The user can add to this environment, but keep in mind that
each addition enlarges the search space.
|
-r1 (exference-1.6.0.0-r1) |
2017-02-13T15:44:08Z |
lspitzner |
c9d2fab979db36a73327b70bbdc74d18d1c9639657e8cee665a173014bb09e42
|
|
Changed source-repository
from source-repository head
type: git
location: git@github.com:lspitzner/multistate.git
to source-repository head
type: git
location: git@github.com:lspitzner/exference.git
|
-r0 (exference-1.6.0.0-r0) |
2017-02-13T15:41:03Z |
lspitzner |
ce962e47bf6cebc6590f9372115cbd41409a61aaed12e25817374c307d9982e1
|
|
|