1226 search results - page 83 / 246 » Proofs, Programs and Abstract Complexity |
124
click to vote
IEEECIT
2010
IEEE
15 years 1 months ago
2010
IEEE
—In need of interesting material and effective teaching approach in programming learning, students were ely to drop out of the course for the abstract concepts and complex struct...
131
click to vote
ICFP
2000
ACM
15 years 7 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
132
click to vote
ENTCS
2008
15 years 3 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
144
click to vote
ITICSE
2005
ACM
15 years 8 months ago
2005
ACM
The complexity of languages like Java and C++ can make introductory programming classes in these languages extremely challenging for many students. Part of the complexity comes fr...
246
Voted
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
: Workflow systems often present the user with rich interfaces that express all the capabilities and complexities of the application programs and the computing environments that th...