A collection of useful string filters.
The possible fixities of operators.
The binary operator occurs in infix position (i.
A pretty-printer with support for pretty-printing expressions with minimal parenthesisation.
Binary expressions that are to be pretty-printed.
Super type of all expressions that are to be pretty-printed.
N-ary infix expressions that are to be pretty-printed.
An expression that contains an operator.
A pretty-printer implemented using the continuation-based approach from Section 3.
The interface of a pretty printer using combinators from Swierstra and Chitil (Linear, bounded, functional pretty-printing, Journal of Functional Programming, 19 (1), 2009) and Leijen's PPrint library.
Unary expressions that are to be pretty-printed.
The sides that an expression may appear on inside another expression or associativities that infix operators can have.
A collection of useful string filters.
The left side or left associativitiy of an infix operator.
No side or non-associativitiy of an infix operator.
The unary operator occurs in postfix position (i.
The unary operator occurs in prefix position (i.
Default pretty printer.
Common type definitions for all pretty-printers.
The right side or right associativitiy of an infix operator.