91 search results - page 15 / 19 » Reducts of Propositional Theories, Satisfiability Relations,... |
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
Information flow controls can be used to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted envi...
KR
2004
Springer
14 years 25 days ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
POPL
2010
ACM
14 years 4 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...