22 search results - page 2 / 5 » Reasoning in Extensional Type Theory with Equality |
TPHOL
2006
IEEE
13 years 11 months ago
2006
IEEE
We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of G¨odel’s T of type (N→N)→(N→N). The gen...
FOSSACS
2011
Springer
12 years 9 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
LICS
2010
IEEE
13 years 4 months ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
FMCAD
2008
Springer
13 years 7 months ago
2008
Springer
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solv...
POPL
2005
ACM
14 years 6 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...