Copyright | (c) 2010-2012 Benedikt Schmidt |
---|---|
License | GPL v3 (see LICENSE) |
Maintainer | Benedikt Schmidt <beschmi@gmail.com> |
Safe Haskell | None |
Language | Haskell98 |
Term.Builtin.Rules
Description
Builtin rewriting rules.
- data RRule a = RRule a a
- dhRules :: Set (RRule LNTerm)
- bpRules :: Set (RRule LNTerm)
- msetRules :: Set (RRule LNTerm)
- pairRules :: Set CtxtStRule
- symEncRules :: Set CtxtStRule
- asymEncRules :: Set CtxtStRule
- signatureRules :: Set CtxtStRule
- module Term.Builtin.Signature
Rewriting rules
A rewrite rule.
Constructors
RRule a a |
dhRules :: Set (RRule LNTerm) #
The rewriting rules for Diffie-Hellman. This is a presentation due to Lankford with the finite variant property.
bpRules :: Set (RRule LNTerm) #
The rewriting rules for bilinear pairing. These rules extend the the rules for Diffie-Hellman.
pairRules :: Set CtxtStRule #
The rewriting rules for standard subterm operators that are builtin.
symEncRules :: Set CtxtStRule #
The rewriting rules for standard subterm operators that are builtin.
asymEncRules :: Set CtxtStRule #
The rewriting rules for standard subterm operators that are builtin.
signatureRules :: Set CtxtStRule #
The rewriting rules for standard subterm operators that are builtin.
Convenience export
module Term.Builtin.Signature