3713 search results - page 94 / 743 » Constructing a Calculus of Programs |
170
click to vote
CI
2000
15 years 2 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
104
click to vote
UAI
2008
15 years 4 months ago
2008
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
115
click to vote
ICSM
1999
IEEE
15 years 7 months ago
1999
IEEE
Exception-handling constructs provide a mechanism for raising exceptions, and a facility for designating protected code by attaching exception handlers to blocks of code. Despite ...
131
click to vote
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
107
click to vote
CIE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...