package dedukti

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Matching solver

package dedukti

dedukti.api
- Api
  - Dep
  - Env
  - Errors
  - Files
  - Meta
    
    APP
    
    ENCODING
    
    LF
    
    MetaConfiguration
    
    PROD
  - Pp
    
    Default
    
    Make
    
    S
    
    Printer
    
    Sig
  - Processor
    
    CustomEnv
    
    Interface
    
    MakeDependencies
    
    E
    
    MakeEntryPrinter
    
    E
    
    MakeSignatureBuilder
    
    E
    
    MakeTypeChecker
    
    E
    
    Registration
    
    S
    
    T
dedukti.kernel
- Kernel
  - Ac
  - Basic
    
    Debug
    
    LList
  - Confluence
  - Dtree
  - Exsubst
    
    ExSubst
  - Matching
    
    Make
    
    R
    
    Matcher
    
    Reducer
  - Reduction
    
    ConvChecker
    
    Default
    
    Make
    
    C
    
    M
    
    S
  - Rule
  - Signature
  - Srcheck
    
    SRChecker
    
    R
  - Subst
  - Term
  - Typing
    
    Default
    
    Make
    
    R
    
    S
  - Version
dedukti.parsers
- Parsers
  - Entry
  - Lexer
  - Menhir_parser
  - Parser
  - Preterm
  - Scoping
  - Tokens

Legend:
Library
Module
Module type
Parameter
Class
Class type

Matching on terms

val d_matching : Basic.Debug.flag

Matching solver

exception NotUnifiable

val solve_miller : Dtree.miller_var -> Term.term -> Term.term

solve_miller var t Solves the matching problem X x1 ... xn = t where var represents the applied Miller variable X x1 ... xn. Raises NotUnifiable in case there is no solution.

module type Reducer = sig ... end

module type Matcher = sig ... end

module Make (R : Reducer) : Matcher

This is the default implementation. * It relies on the provided : * - whnf reduction strategy to flatten AC terms without digging to deep inside * - snf reduction strategy to perform higher order matching when necessary * - are_convertible convertibility test