Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Br...
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...