2944 search results - page 129 / 589 » On Well Quasi-orders on Languages |
102
Voted
AGENTS
2001
Springer
15 years 5 months ago
2001
Springer
PHOSPHORUS is an agent matchmaking service that exploits domain ontologies, description logic, and a highly declarative language to reason about task-related agent capabilities. P...
102
Voted
FSTTCS
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. Synchronous languages are well suited for the design of dependable real-time systems: they enable a very high-level specification and an extremely modular implementation ...
92
Voted
ICFP
1996
ACM
15 years 4 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
88
Voted
DLT
2008
15 years 2 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
87
Voted
SE
2008
15 years 2 months ago
2008
: The increased usage of Web services for critical applications introduces a growing need for efficient testing approaches to assure their quality. The Testing and Test Control Not...