643 search results - page 101 / 129 » Semantic Determinism and Functional Logic Program Properties |
148
click to vote
FPCA
1995
15 years 5 months ago
1995
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
111
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
126
click to vote
ICFP
2005
ACM
16 years 1 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...
152
click to vote
SIGSOFT
2006
ACM
15 years 7 months ago
2006
ACM
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
103
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...