ghc-justdoit: A magic typeclass that just does it

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

This plugin allows you to write

{-# OPTIONS_GHC -fplugin GHC.JustDoIt.Plugin #-}
module Test where

import GHC.JustDoIt

foo :: ((a -> r) -> r) -> (a -> ((b -> r) -> r)) -> ((b -> r) -> r)
foo = (…)

without having to write the actual implementation of foo.

See examples/Demo.hs for a few examples of what this plugin can do for you.

[Skip to Readme]

Properties

Versions	0.1, 0.1, 0.1.0.1, 0.1.0.2
Change log	ChangeLog.md
Dependencies	base (>=4.11 && <4.12), ghc (>=8.5), hashable [details]
License	MIT
Copyright	2018 Joachim Breitner
Author	Joachim Breitner
Maintainer	mail@joachim-breitner.de
Category	Language
Home page	https://github.com/nomeata/ghc-justdoit
Source repo	head: git clone git://github.com/nomeata/ghc-justdoit.git
Uploaded	by JoachimBreitner at 2018-02-02T20:13:11Z

Modules

GHC
- GHC.JustDoIt
  - GHC.JustDoIt.Plugin
  - GHC.JustDoIt.Solver
- GHC.LJT

Downloads

ghc-justdoit-0.1.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

JoachimBreitner

For package maintainers and hackage trustees

edit package information

Readme for ghc-justdoit-0.1

[back to package description]

ghc-justdoit: a GHC plugin to write the code for you

This is a prototype of a code synthesis plugin for GHC, which uses LJT proof search to instantiate a type.

Synopsis

{-# OPTIONS_GHC -fplugin=GHC.JustDoIt.Plugin #-}
module Test where

import GHC.JustDoIt

foo :: ((a -> r) -> r) -> (a -> ((b -> r) -> r)) -> ((b -> r) -> r)
foo = (…)

Missing bits

The LJT might not be complete, due to insufficient backtracking.
The implementation is very much unoptimized.
It returns one solution, but not necessary the “best” one. But what is the “best” one?
It ignores any recursive type, so it cannot do anything with lists. It would be much more useful if it could do some best-effort thing her as well.

If someone wants to pick it up from here, that’d be great!

Contact

Please reports bugs and missing features at the GitHub bugtracker. This is also where you can find the source code.

bSpokeLight was written by Joachim Breitner and is licensed under a permissive MIT license.