2145 search results - page 187 / 429 » Lax Logical Relations |
95
Voted
TPHOL
2003
IEEE
15 years 6 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
100
Voted
FOIS
2010
15 years 2 months ago
2010
Considerations regarding predication in ordinary language as well as the ontology of relations suggest a refinement of the Ontological Square, a conceptual scheme used in many foun...
105
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
99
Voted
FSS
2006
15 years 23 days ago
2006
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
126
Voted
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...