1226 search results - page 63 / 246 » Proofs, Programs and Abstract Complexity |
162
click to vote
PC
2002
15 years 2 months ago
2002
riented programming, design patterns, and frameworks are abstraction techniques that have been used to reduce the complexity of sequential programming. This paper describes our ap...
122
click to vote
AI
2002
Springer
15 years 3 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
142
click to vote
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
144
click to vote
CIE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
116
click to vote
PADL
2010
Springer
16 years 2 days ago
2010
Springer
Abstract. Interactive programming is a method for implementing programming languages that supports an interactive, exploratory style of program development and debugging. The basic...