4008 search results - page 256 / 802 » An expressive language of signatures |
192
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
In the semantic web architecture, Web ontology languages are built on top of RDF(S). However, serious difficulties have arisen when trying to layer expressive ontology languages, ...
290
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
190
click to vote
ECOOP
2004
Springer
16 years 17 hour ago
2004
Springer
Software developers create a variety of artifacts that model viour of applications at different levels of abstraction; e.g. use cases, sequence diagrams, and source code. Aspect-o...
187
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
152
click to vote
ECOOP
2008
Springer
15 years 8 months ago
2008
Springer
Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associa...