| Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/Roqc/tactics/ (Beweissystem des Inria Version 9.1.0©) Datei vom 15.8.2025 mit Größe 1 kB |
|
Quelle dn.mli Sprache: SML |
|||||||||
|
type 'res lookup_res = Label of 'res | Nothing | Everything
module Make : functor (Y : Map.OrderedType) -> functor (Z : Map.OrderedType) -> sig type 'a decompose_fun = 'a -> (Y.t * 'a list) option type t val empty : t (** [add t f (tree,inf)] adds a structured object [tree] together with the associated information [inf] to the table [t]; the function [f] is used to translated [tree] into its prefix decomposition: [f] must decompose any tree into a label characterizing its root node and the list of its subtree *) type pattern val pattern : 'a decompose_fun -> 'a -> pattern val add : t -> pattern -> Z.t -> t val rmv : t -> pattern -> Z.t -> t type 'tree lookup_fun = 'tree -> (Y.t * 'tree list) lookup_res (** [lookup t f tree] looks for trees (and their associated information) in table [t] such that the structured object [tree] matches against them; [f] is used to translated [tree] into its prefix decomposition: [f] must decompose any tree into a label characterizing its root node and the list of its subtree *) val lookup : t -> 'term lookup_fun -> 'term -> Z.t list end ¤ Dauer der Verarbeitung: 0.15 Sekunden (vorverarbeitet) ¤*© Formatika GbR, Deutschland |
|
2026-03-28