4438 search results - page 191 / 888 » The Case for Collaborative Programming |
172
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
142
click to vote
IIE
2006
15 years 6 months ago
2006
Abstract. For many programming tasks we would be glad to have some kind of automatic evaluation process. As an example, most of the programming contests use an automatic evaluation...
186
click to vote
JISE
2008
15 years 6 months ago
2008
abstract the state-based behavior of AOP program with the consideration of the interactions between the base modules and aspects. Based on the model, test cases can be derived so a...
171
click to vote
CASES
2009
ACM
16 years 1 months ago
2009
ACM
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
127
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...