24 search results - page 3 / 5 » On the Strength of Proof-Irrelevant Type Theories |
TLCA
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
NIPS
2007
13 years 6 months ago
2007
A non–linear dynamic system is called contracting if initial conditions are forgotten exponentially fast, so that all trajectories converge to a single trajectory. We use contra...
CHI
2007
ACM
14 years 5 months ago
2007
ACM
For years the HCI community has struggled to integrate design in research and practice. While design has gained a strong foothold in practice, it has had much less impact on the H...
CLA
2004
13 years 6 months ago
2004
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
IHI
2010
13 years 6 days ago
2010
Medical practice is increasingly based on the best available evidence, but the volume of information requires many clinicians to rely on systematic reviews rather than the primary...