3713 search results - page 468 / 743 » Constructing a Calculus of Programs |
145
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
131
click to vote
ESOP
2012
Springer
13 years 12 months ago
2012
Springer
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...
162
click to vote
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
254
click to vote
ECOOP
2009
Springer
16 years 4 months ago
2009
Springer
The primary goal of exception mechanisms is to help ensure that when an operation fails, code that depends on the operation's successful completion is not executed (a property...
126
click to vote
IJCAI
1993
15 years 5 months ago
1993
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...