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=2c251021b6fac40c05282ca183902da5b1008e69d9179d7a9543905c2c21a28a

sha512=69535f92766e6fedc2675fc214f0fb699bde2a06aa91d338c93c99756235a293cf16776f6328973dda07cf2ad402e58fe3104a08f1a896990c1778b42f7f9fcf

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