Combinators Namespace Reference

Classes
struct	CL
struct	cl_void
class	ReductionException
class	SKGrammar

Functions
template<typename Grammar_t >
Primitive< Combinators::CL >	CL_I (Op::CL_I, BUILTIN_LAMBDA {assert(false);})
template<typename Grammar_t >
Primitive< Combinators::CL >	CL_S (Op::CL_S, BUILTIN_LAMBDA {assert(false);})
template<typename Grammar_t >
Primitive< Combinators::CL >	CL_K (Op::CL_K, BUILTIN_LAMBDA {assert(false);})
template<typename Grammar_t >
Primitive< Combinators::CL, Combinators::CL, Combinators::CL >	CL_Apply (Op::CL_Apply, BUILTIN_LAMBDA {assert(false);})
void	reduce (SExpression::SExpNode &n, int &remaining_calls)
	Combinator reduction, assuming that n is a SExpNode. More...
void	reduce (SExpression::SExpNode &n)
SExpression::SExpNode	NodeToSExpNode (const Node &n)
Node	SExpNodeToNode (const SExpression::SExpNode &n)
template<typename L >
void	substitute (SExpression::SExpNode &n, const L &m)

Variables
Combinators::SKGrammar	skgrammar
Combinators::ReductionException	reduction_exception

Function Documentation

CL_Apply()

template<typename Grammar_t >

Primitive<Combinators::CL, Combinators::CL, Combinators::CL> Combinators::CL_Apply	(	Op::CL_Apply	,
		BUILTIN_LAMBDA {assert(false);}
	)

CL_I()

template<typename Grammar_t >

Primitive<Combinators::CL> Combinators::CL_I	(	Op::CL_I	,
		BUILTIN_LAMBDA {assert(false);}
	)

CL_K()

template<typename Grammar_t >

Primitive<Combinators::CL> Combinators::CL_K	(	Op::CL_K	,
		BUILTIN_LAMBDA {assert(false);}
	)

CL_S()

template<typename Grammar_t >

Primitive<Combinators::CL> Combinators::CL_S	(	Op::CL_S	,
		BUILTIN_LAMBDA {assert(false);}
	)

NodeToSExpNode()

SExpression::SExpNode Combinators::NodeToSExpNode

(

const Node &

n

)

reduce() [1/2]

void Combinators::reduce	(	SExpression::SExpNode &	n,
		int &	remaining_calls
	)

Combinator reduction, assuming that n is a SExpNode.

Parameters

n
remaining_calls

reduce() [2/2]

void Combinators::reduce

(

SExpression::SExpNode &

n

)

SExpNodeToNode()

Node Combinators::SExpNodeToNode

(

const SExpression::SExpNode &

n

)

substitute()

template<typename L >

void Combinators::substitute	(	SExpression::SExpNode &	n,
		const L &	m
	)

Variable Documentation

reduction_exception

Combinators::ReductionException Combinators::reduction_exception

skgrammar

Combinators::SKGrammar Combinators::skgrammar