Term.Maude.Parser

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

Copyright | (c) 2010 2011 Benedikt Schmidt
License | GPL v3 (see LICENSE)
Maintainer | Benedikt Schmidt <beschmi@gmail.com>
Safe Haskell | None
Language | Haskell98

Term.Maude.Parser

Contents

- pretty printing of terms for Maude
- parsing of Maude replies

Description

Pretty printing and parsing of Maude terms and replies.

Synopsis

- ppMaude :: Term MaudeLit -> ByteString
- ppTheory :: MaudeSig -> ByteString
- parseUnifyReply :: MaudeSig -> ByteString -> Either String [MSubst]
- parseMatchReply :: MaudeSig -> ByteString -> Either String [MSubst]
- parseReduceReply :: MaudeSig -> ByteString -> Either String MTerm

# pretty printing of terms for Maude

ppMaude :: Term MaudeLit -> ByteString #

`ppMaude t` pretty prints the term `t` for Maude.

ppTheory :: MaudeSig -> ByteString #

The term algebra and rewriting rules as a functional module in Maude.

# parsing of Maude replies

parseUnifyReply :: MaudeSig -> ByteString -> Either String [MSubst] #

`parseUnifyReply reply` takes a `reply` to a unification query returned by Maude and extracts the unifiers.

parseMatchReply :: MaudeSig -> ByteString -> Either String [MSubst] #

`parseMatchReply reply` takes a `reply` to a match query returned by Maude and extracts the unifiers.

parseReduceReply :: MaudeSig -> ByteString -> Either String MTerm #

`parseReduceReply l` parses a single solution returned by Maude.