tamarin-prover-term-1.2.2: Term manipulation library for the tamarin prover.

Copyright(c) 2011-2012 Benedikt Schmidt
LicenseGPL v3 (see LICENSE)
MaintainerBenedikt Schmidt <beschmi@gmail.com>
Safe HaskellNone
LanguageHaskell98

Term.SubtermRule

Contents

Description

Context Subterm rewriting rules.

Synopsis

Documentation

data StRhs #

The righthand-side of a context subterm rewrite rule. Does not enforce that the term for RhsGround must be ground.

Constructors

StRhs [Position] LNTerm 

Instances

Eq StRhs # 

Methods

(==) :: StRhs -> StRhs -> Bool #

(/=) :: StRhs -> StRhs -> Bool #

Ord StRhs # 

Methods

compare :: StRhs -> StRhs -> Ordering #

(<) :: StRhs -> StRhs -> Bool #

(<=) :: StRhs -> StRhs -> Bool #

(>) :: StRhs -> StRhs -> Bool #

(>=) :: StRhs -> StRhs -> Bool #

max :: StRhs -> StRhs -> StRhs #

min :: StRhs -> StRhs -> StRhs #

Show StRhs # 

Methods

showsPrec :: Int -> StRhs -> ShowS #

show :: StRhs -> String #

showList :: [StRhs] -> ShowS #

Generic StRhs # 

Associated Types

type Rep StRhs :: * -> * #

Methods

from :: StRhs -> Rep StRhs x #

to :: Rep StRhs x -> StRhs #

Binary StRhs # 

Methods

put :: StRhs -> Put #

get :: Get StRhs #

putList :: [StRhs] -> Put #

NFData StRhs # 

Methods

rnf :: StRhs -> () #

type Rep StRhs # 
type Rep StRhs = D1 (MetaData "StRhs" "Term.SubtermRule" "tamarin-prover-term-1.2.2-AAX5pCkSPqj7TesI35mR1r" False) (C1 (MetaCons "StRhs" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Position])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LNTerm))))

data CtxtStRule #

A context subterm rewrite rule. The left hand side as a LNTerm, and a StRHS.

Constructors

CtxtStRule LNTerm StRhs 

rRuleToCtxtStRule :: RRule LNTerm -> Maybe CtxtStRule #

Convert a rewrite rule to a context subterm rewrite rule if possible.

ctxtStRuleToRRule :: CtxtStRule -> RRule LNTerm #

Convert a context subterm rewrite rule to a rewrite rule.

Pretty Printing