package lambdapi

You can search for identifiers within the package.

in-package search v0.2.0

Proof assistant for the λΠ-calculus modulo rewriting

Install

dune-project

Dependency

github.com Readme Changelog Edit opam file Versions (12)

Authors

D

Deducteam

Maintainers

D

dedukti-dev@inria.fr

Sources

lambdapi-2.3.0.tbz

sha256=9b13c3121ef87cf4d3311a8a1db43db4be7f0e5e2a702fdaff04a3b3c432cb31

sha512=81e0760ca77cb862a5bdb8927aa37faf7141c4e2484a8163dad0a3eaa21cc691acb5f72279c78588c085f53dde4bd35186346378feac0ab55ac06a679cf2e60f

doc/lambdapi.core/Core/Inverse/index.html

Module `Core.Inverse`Source

Compute the inverse image of a term wrt an injective function.

Sourceval log_inv : 'a Lplib.Base.outfmt -> 'a

Sourceval cache : (Term.sym -> 'a) -> Term.sym -> 'a

cache f s is equivalent to f s but f s is computed only once unless the rules of s are changed.

Sourceval const_graph : Term.sym -> (Term.sym * Term.sym) list

cached version of const_rules.

Sourceval inverse_const : Term.sym -> Term.sym -> Term.sym

inverse_const s s' returns s0 if s has a rule of the form s (s0 ...) ↪ s' ....

raises [Not_found]
otherwise.

Sourceval prod_graph : Term.sym -> (Term.sym * Term.sym * Term.sym * bool) list

cached version of prod_graph.

Source

val inverse_prod : 
  Term.sym ->
  Term.sym ->
  Term.sym * Term.sym * Term.sym * bool

inverse_prod s s' returns (s0,s1,s2,b) if s has a rule of the form s (s0 _ _) ↪ Π x:s1 _, s2 r with b=true iff x occurs in r, and either s1 has a rule of the form s1 (s3 ...) ↪ s' ... or s1 == s'.

raises [Not_found]
otherwise.

Sourceval inverse : Term.sym -> Term.term -> Term.term