1631 search results - page 56 / 327 » Observing Functional Logic Computations |
FMCAD
2008
Springer
13 years 11 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
CSR
2008
Springer
13 years 11 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
ECML
2006
Springer
14 years 1 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
BIRTHDAY
2000
Springer
14 years 2 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
TCS
2011
13 years 4 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...