The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Understanding experience is a critical issue for a variety of professions, especially design. To understand experience and the user experience that results from interacting with p...
The understanding of human physical and physiological signals and expressions, together with a growing processing and control capacity allows for new approaches in interactive sys...