237 search results - page 2 / 48 » An Operational Approach to Combining Classical Set Theory an... |
ESOP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
JMLR
2006
13 years 4 months ago
2006
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...
PPDP
2001
Springer
13 years 9 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...