23 search results - page 3 / 5 » Higher-order representation of substructural logics |
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
JELIA
1990
Springer
14 years 2 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
ESOP
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
IGPL
2011
13 years 5 months ago
2011
We show that the equational theory of representable lattice-ordered residuated semigroups is not finitely axiomatizable. We apply this result to the problem of completeness of su...
ICFP
2010
ACM
13 years 12 months ago
2010
ACM
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...