Safe Haskell	None
Language	Haskell2010

FlatParse.Examples.BasicLambda.Parser

Description

This module contains a simple lambda calculus parser. This parser is not optimized for maximum performance; instead it's written in a style which emulates the look and feel of conventional monadic parsers. An optimized implementation would use low-level switch expressions more often.

Synopsis

type Name = ByteString
data Tm
- = Var Name
- | App Tm Tm
- | Lam Name Tm
- | Let Name Tm Tm
- | BoolLit Bool
- | IntLit Int
- | If Tm Tm Tm
- | Add Tm Tm
- | Mul Tm Tm
- | Eq Tm Tm
- | Lt Tm Tm
ident :: Parser Name
cutIdent :: Parser Name
digit :: Parser Int
int :: Parser Int
atom :: Parser Tm
app :: Parser Tm
mul :: Parser Tm
add :: Parser Tm
eqLt :: Parser Tm
pLet :: Parser Tm
lam :: Parser Tm
pIf :: Parser Tm
tm :: Parser Tm
src :: Parser Tm

Documentation

type Name = ByteString Source #

data Tm Source #

A term in the language. The precedences of different constructs are the following, in decreasing order of strength:

Identifiers, literals and parenthesized expressions
Function application (left assoc)
Multiplication (left assoc)
Addition (left assoc)
Equality, less-than (non-assoc)
lam, let, if (right assoc)

Constructors

Var Name	x
App Tm Tm	t u
Lam Name Tm	lam x. t
Let Name Tm Tm	let x = t in u
BoolLit Bool	`true` or `false`.
IntLit Int	A positive `Int` literal.
If Tm Tm Tm	if t then u else v
Add Tm Tm	t + u
Mul Tm Tm	t * u
Eq Tm Tm	t == u
Lt Tm Tm	t < u

Instances

Instances details

Show Tm Source #
Instance details Defined in FlatParse.Examples.BasicLambda.Parser Methods showsPrec :: Int -> Tm -> ShowS # show :: Tm -> String # showList :: [Tm] -> ShowS #