197 search results - page 6 / 40 » Efficient Inference of Partial Types |
TCS
2008
13 years 7 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
AMAST
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
This paper gives an efficient Bayesian method for inferring the parameters of a PlackettLuce ranking model. Such models are parameterised distributions over rankings of a finite s...
TPHOL
2002
IEEE
14 years 9 days ago
2002
IEEE
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...