5904 search results - page 390 / 1181 » Requirements for a Composition Language |
177
click to vote
STOC
1990
ACM
15 years 11 months ago
1990
ACM
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
173
click to vote
PLPV
2010
ACM
16 years 3 months ago
2010
ACM
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
172
click to vote
IWPC
2003
IEEE
16 years 6 days ago
2003
IEEE
Many applications have one or more important modules that are written in a language other than conventional procedural or object oriented languages. These languages are often tran...
195
click to vote
BXML
2004
15 years 8 months ago
2004
: The Extensible Markup Language (XML) is based on the concept of schema languages, which are used for validation of XML documents. In most cases, the metamodeling view of XML-base...
183
click to vote
ASPLOS
2006
ACM
16 years 27 days ago
2006
ACM
Nested transactional memory (TM) facilitates software composition by letting one module invoke another without either knowing whether the other uses transactions. Closed nested tr...