407 search results - page 56 / 82 » Malleable Proof Systems and Applications |
STOC
2009
ACM
14 years 2 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
A lot of functionality is needed when an application, such as a museum cataloguing system, is extended with semantic capabilities, for example ontological indexing functionality or...
TLDI
2010
ACM
14 years 4 months ago
2010
ACM
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
ECOOP
2010
Springer
14 years 11 days ago
2010
Springer
Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects...
APAL
2010
13 years 7 months ago
2010
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTT0 and LTT 0, which we...