We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
Evolving and maintaining software requires adequate documentation of its implementation. However, due to the software's constant evolution, the documentation and implementati...
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...