theory from FOLDOC

theory entries

abstract interpretation	abstract machine	Actors
algebraic	Algebra of Communicating Processes	alpha conversion
Array Theory	autoprojector	axiomatic semantics
axiomatic set theory	backward analysis	beta conversion
Bird-Meertens Formalism	bottom	bounded
boundedly complete	Busy Beaver	CA
canonicity	category	chain
Church integer	Church-Rosser Theorem	closed term
closure	closure conversion	coalesced sum
codomain	combinator	compact
compactness preserving	complete metric space	complete partial ordering
Concrete Data Structure	decision problem	delta reduction
denotational semantics	deterministic automaton	directed set
discriminated union	distributive lattice	domain theory
effective computable	embedding	entropy
eta conversion	evaluator	Finite State Machine
FSM	Gottlob Frege	greatest lower bound
Head Normal Form	head-strict	ideal
inclusive	Isabelle	join
lattice	least upper bound	lifted domain
linear argument	linear logic	linear topology
linear type	Liskov substitution principle	minimal automaton
model checking	monad	monadic
nondeterministic automaton	open/closed principle	operational semantics
pi-calculus	pointed domain	polymorphism
powerdomain	predomain	pre-order
projection	recursion theory	reduction strategy
reflexive	relational algebra	search
search algorithm	semantics	set complement
state	static	static analysis
sticky analysis	sum	syntax tree
transparent	type	type assignment
typed lambda-calculus	union	Weak Head Normal Form