Sciweavers

4099 search results - page 148 / 820
» A Framework for Interactive Proof
Sort
View
TLCA
2007
Springer
15 years 4 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
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...
Denis Cousineau 0002, Gilles Dowek
TLCA
1997
Springer
15 years 2 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
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 ...
Michael Brandt, Fritz Henglein
CADE
2011
Springer
13 years 10 months ago
Experimenting with Deduction Modulo
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...
Guillaume Burel
ACMDIS
2004
ACM
15 years 3 months ago
Understanding experience in interactive systems
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...
Jodi Forlizzi, Katja Battarbee
71
Voted
SAC
2009
ACM
15 years 4 months ago
Development of a biosignals framework for usability analysis
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...
Inês Oliveira, Rui Lopes, Nuno Guimarã...