1288 search results - page 93 / 258 » Visual Generalization in Programming by Example |
97
Voted
FSTTCS
1993
Springer
15 years 6 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
110
Voted
ICFP
2007
ACM
16 years 2 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
104
Voted
PLPV
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents a resource typing framework for the Guru d-programming language, in which abstractions for various kinds of program resources can be defined. Implemented exam...
178
Voted
TSE
2011
14 years 9 months ago
2011
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...
111
click to vote
VL
1992
IEEE
15 years 6 months ago
1992
IEEE
If future electronic documents are to be truly useful, we must devise ways to automatically turn them into knowledgebases. In particular, we must be able to do this for diagrams. ...