User:Jmcgarey/Books/Programming Language Theory


 * Programming language theory
 * Abstract syntax
 * Divergence (computer science)
 * First-class function
 * Function-level programming
 * Higher-order abstract syntax
 * Logic error
 * Logic of Computable Functions
 * Non-local variable
 * POPLmark challenge
 * Programming Computable Functions
 * Proof-carrying code
 * Qualification principle
 * Referential transparency
 * Semantic error
 * Side effect (computer science)
 * Structured program theorem
 * Syntax error
 * Turing completeness
 * Typed assembly language
 * Variadic
 * Lambda calculus
 * Anonymous function
 * Applicative computing systems
 * Apply
 * B, C, K, W system
 * Beta normal form
 * Binary lambda calculus
 * Böhm tree
 * Calculus of constructions
 * Call-by-push-value
 * Cartesian closed category
 * Church encoding
 * Church–Rosser theorem
 * Combinatory logic
 * Context change potential
 * Currying
 * De Bruijn index
 * De Bruijn notation
 * Deductive lambda calculus
 * Director string
 * Explicit substitution
 * Fixed-point combinator
 * Higher-order function
 * Hindley–Milner type system
 * Kleene–Rosser paradox
 * Knights of the Lambda Calculus
 * Lambda calculus definition
 * Lambda cube
 * Lambda lifting
 * Lambda-mu calculus
 * Let expression
 * Mogensen–Scott encoding
 * Montague grammar
 * Normalisation by evaluation
 * Normalization property (abstract rewriting)
 * Pattern calculus
 * Pure type system
 * Reduction strategy (lambda calculus)
 * Rho calculus
 * Simply typed lambda calculus
 * SKI combinator calculus
 * Supercombinator
 * System F
 * System F-sub
 * System U
 * Type inhabitation
 * Typed lambda calculus
 * Untyped lambda calculus
 * Η-conversion
 * Abstract rewriting system
 * Buchberger's algorithm
 * Canonical rewriting system
 * Confluence (abstract rewriting)
 * Congruence closure
 * Convergence (logic)
 * Critical pair (logic)
 * Dershowitz–Manna ordering
 * Encompassment ordering
 * Gröbner basis
 * Jean-Pierre Jouannaud
 * Knuth–Bendix completion algorithm
 * Markov algorithm
 * Newman's lemma
 * Normal form (abstract rewriting)
 * Orthogonality (term rewriting)
 * Overlap (term rewriting)
 * Path ordering (term rewriting)
 * Reduction (abstract rewriting)
 * Reduction ordering
 * Reduction strategy (code optimization)
 * Reflexive closure
 * Rewrite order
 * Rewriting
 * Semi-Thue system
 * Symmetric closure
 * Term (logic)
 * Termination (term rewriting)
 * Unification (computer science)
 * Word problem (mathematics)
 * Semantics (computer science)
 * Action semantics
 * Algebraic semantics (computer science)
 * Axiomatic semantics
 * Denotational semantics
 * Dynamic semantics
 * Execution semantics
 * Full abstraction
 * J operator
 * Liskov substitution principle
 * Logical relations
 * Natural semantics
 * Observational equivalence
 * Operational semantics