Skip to content
Dependently typed logic programming in meta-haskell!
Haskell
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.
Types
Example.hs
Kinds.hs
LICENSE
README.textile

README.textile

Dependently typed logic programming in meta-haskell!

Overview

An example of using dependently typed logic programming in haskell’s
type system to do theorem proved template black magic without templates.

Details

A big step semantics for lazy lambda
calculus on types used on class logic programming,
and an Isomorphism class which forces a class and
instances under different data types to be isomorphic
to a GADT with constructors such that we the class
can not be instanced elsewhere with more datatypes.

Something went wrong with that request. Please try again.