16 search results - page 3 / 4 » Cut-Simulation in Impredicative Logics |
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding ...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...