1017 search results - page 87 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
OOPSLA
2005
Springer
15 years 3 months ago
2005
Springer
We describe (and demonstrate) the execution model of a computing platform where computation is both incremental and data-driven. We call such an approach delta-driven. The platfor...
POPL
1998
ACM
15 years 2 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...