297 search results - page 19 / 60 » ATS: A Language That Combines Programming with Theorem Provi... |
ICFP
2010
ACM
15 years 24 days ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
ENTCS
2002
14 years 11 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
104
click to vote
CSFW
1997
IEEE
15 years 3 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
ESOP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper contributes a technique that expands the set of object invariants that one can reason about in modular verification. The technique uses history invariants, tw...
AAAI
1992
15 years 26 days ago
1992
We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which ...