package lambdapi

You can search for identifiers within the package.

in-package search v0.2.0

Proof assistant for the λΠ-calculus modulo rewriting

Install

sha256=d01e5f13db2eaba6e4fe330667149e0059d4886c651ff9d6b672db2dfc9765ed

sha512=33b68c972aca37985ed73c527076198e7d4961c7e27c89cdabfe4d1cff97cd41ccfb85ae9499eb98ad9a0aefd920bc55555df6393fc441ac2429e4d99cddafa8

Module to create p_term's with no positions.

Sourceval qiden : Common.Path.t -> string -> p_term

qiden p s builds a P_Iden "@p.s".

Sourceval iden : string -> p_term

iden s builds a P_Iden "@s".

Sourceval var : Core.Term.tvar -> p_term

var v builds a P_Iden from Bindlib.name_of v.

Sourceval patt : string -> p_term array option -> p_term

patt s ts builds a P_Patt "$sts".

Sourceval patt0 : string -> p_term

patt0 s builds a P_Patt "$s".

Sourceval appl : p_term -> p_term -> p_term

appl t u builds P_Appl(t, u).

Sourceval appl_list : p_term -> p_term list -> p_term

appl_list t ts iterates appl.

Sourceval wild : p_term_aux Common.Pos.loc

wild builds a P_Wild.

Sourceval appl_wild : p_term -> int -> p_term

appl_wild t n applies t to n underscores.

Sourceval abst : p_ident option -> p_term -> p_term

abst idopt t builds a P_Abst over t.

Sourceval abst_list : p_ident option list -> p_term -> p_term

abst_list iterates abst.

Sourceval rule : p_term -> p_term -> p_rule