Post Correspondence Programming Language

Index

acceptStateLanguage.UTM.Syntax
ActionLanguage.UTM.Syntax
blankSymbolLanguage.UTM.Syntax
BottomLanguage.PCPL.Solver
compileTMLanguage.PCPL.CompileTM, Language.PCPL
compileTM'Language.PCPL.CompileTM, Language.PCPL
ComputationHistoryLanguage.UTM.Syntax
Configuration 
1 (Type/Class)Language.PCPL.Solver
2 (Data Constructor)Language.UTM.Syntax
3 (Type/Class)Language.UTM.Syntax
Domino 
1 (Data Constructor)Language.PCPL.Syntax, Language.PCPL
2 (Type/Class)Language.PCPL.Syntax, Language.PCPL
dominosLanguage.PCPL.Syntax, Language.PCPL
InputLanguage.UTM.Syntax
inputAlphabetLanguage.UTM.Syntax
LLanguage.UTM.Syntax
Node 
1 (Data Constructor)Language.PCPL.Solver
2 (Type/Class)Language.PCPL.Solver
parensMatcherLanguage.PCPL
PCPLanguage.PCPL.Solver
PrettyLanguage.PCPL.Pretty, Language.PCPL
prettyLanguage.PCPL.Pretty, Language.PCPL
Program 
1 (Data Constructor)Language.PCPL.Syntax, Language.PCPL
2 (Type/Class)Language.PCPL.Syntax, Language.PCPL
RLanguage.UTM.Syntax
rejectStateLanguage.UTM.Syntax
runProgramLanguage.PCPL
searchLanguage.PCPL.Solver
separatorLanguage.PCPL.Syntax, Language.PCPL
SeperatorLanguage.PCPL.CompileTM, Language.PCPL
startDominoLanguage.PCPL.Syntax, Language.PCPL
startStateLanguage.UTM.Syntax
State 
1 (Data Constructor)Language.UTM.Syntax
2 (Type/Class)Language.UTM.Syntax
Symbol 
1 (Type/Class)Language.PCPL.Syntax, Language.PCPL
2 (Data Constructor)Language.UTM.Syntax
3 (Type/Class)Language.UTM.Syntax
syms 
1 (Function)Language.PCPL.Syntax, Language.PCPL
2 (Function)Language.UTM.Syntax
Tape 
1 (Data Constructor)Language.UTM.Syntax
2 (Type/Class)Language.UTM.Syntax
tapeAlphabetLanguage.UTM.Syntax
TopLanguage.PCPL.Solver
topStringLanguage.PCPL
TransitionFunctionLanguage.UTM.Syntax
transitionFunctionLanguage.UTM.Syntax
TuringMachine 
1 (Data Constructor)Language.UTM.Syntax
2 (Type/Class)Language.UTM.Syntax
unaryAdderLanguage.PCPL
unsyms 
1 (Function)Language.PCPL.Syntax, Language.PCPL
2 (Function)Language.UTM.Syntax
updateConfLanguage.PCPL.Solver