package lambdapi

  1. Overview
  2. Docs
Proof assistant for the λΠ-calculus modulo rewriting

Install

Dune Dependency

Authors

Maintainers

Sources

lambdapi-2.6.0.tbz
sha256=d01e5f13db2eaba6e4fe330667149e0059d4886c651ff9d6b672db2dfc9765ed
sha512=33b68c972aca37985ed73c527076198e7d4961c7e27c89cdabfe4d1cff97cd41ccfb85ae9499eb98ad9a0aefd920bc55555df6393fc441ac2429e4d99cddafa8

doc/lambdapi.parsing/Parsing/DkRule/index.html

Module Parsing.DkRuleSource

get_args t decomposes the parser level term t into a spine (h,args), when h is the term at the head of the application and args is the list of all its arguments. The arguments are stored together with the position of the corresponding application node in the source code. Note that h is guaranteed not to be a P_Appl node. Term constructors with no equivalent in the dk syntax (like binary symbol applications) are not handled.

add_args t args builds the application of the term t to the arguments args. When args is empty, the returned value is exactly t. Note that this function is the inverse of get_args (in some sense).

Representation of a reduction rule, with its context.

Sourceval to_p_rule : p_dk_rule -> Syntax.p_rule

to_p_rule r transforms the dk representation of a rule into the lp representation.

OCaml

Innovation. Community. Security.