Skip to content
This repository has been archived by the owner on Feb 1, 2021. It is now read-only.

A very simple module's language for theorem proving

License

Unknown and 2 other licenses found

Licenses found

Unknown
LICENSE
Unknown
LICENSE.APACHE
MIT
LICENSE.MIT
Notifications You must be signed in to change notification settings

dannypsnl-fork/typical

Repository files navigation

typical

Basic Syntax

  1. data(inductive type)

    (data Nat
        [zero : Nat]
        [suc : (Nat . -> . Nat)])
  2. define introduces user-defined variables

    ; define `a` is `zero`
    (define a : Nat
      zero)
  3. check type of term

    ; read as "check `zero` is a `Nat`?"
    (check zero : Nat)

TODO

  • strictly positive of data type
  • dependent function

About

A very simple module's language for theorem proving

Topics

Resources

License

Unknown and 2 other licenses found

Licenses found

Unknown
LICENSE
Unknown
LICENSE.APACHE
MIT
LICENSE.MIT

Stars

Watchers

Forks

Releases

No releases published