The Complexity of Type Inference for Higher-Order Typed lambda Calculi.
Fritz HengleinHarry G. MairsonPublished in: J. Funct. Program. (1994)
Keyphrases
- higher order
- lambda calculus
- database query languages
- programming language
- natural images
- high order
- low order
- worst case
- bayesian networks
- probabilistic inference
- computational complexity
- pairwise
- computational cost
- markov random field
- predicate calculus
- lower order
- type checking
- similarity measure
- lower bound
- rough sets
- bayesian inference
- inference process
- multiscale
- fixed order