The Complexity of Type Inference for Higher-Order Typed Lambda Calculi.
Fritz HengleinHarry G. MairsonPublished in: POPL (1991)
Keyphrases
- higher order
- lambda calculus
- database query languages
- programming language
- natural images
- predicate calculus
- high order
- pairwise
- type checking
- low order
- markov random field
- bayesian networks
- program understanding
- computational complexity
- database
- bayesian inference
- space complexity
- higher order cliques
- decision problems
- probabilistic model
- hidden markov models
- database systems
- artificial intelligence
- data sets