26 search results - page 1 / 6 » Semantic Interpretation as Higher-Order Deduction |
JELIA
1990
Springer
13 years 9 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...
POPL
1998
ACM
13 years 9 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...