6740 search results - page 980 / 1348 » Using Classification as a Programming Language |
135
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
191
click to vote
CSFW
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we develop a language of mobile agents called uPLAN for describing the capabilities of active (programmable) networks. We use a formal semantics for uPLAN to demonst...
166
click to vote
WCRE
2000
IEEE
15 years 11 months ago
2000
IEEE
Recently exchange formats have gained lots of attention. Multiple tools need to interact and/or work on the same software system. Especially there is a need to reuse parser techno...
156
click to vote
KBSE
1997
IEEE
15 years 11 months ago
1997
IEEE
There are a number of competing component models in use today. Most are language-independent, but also platform-dependent and not designed to support a tool-based development para...
177
click to vote
SIGCSE
1996
ACM
15 years 11 months ago
1996
ACM
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...