921 search results - page 85 / 185 » Expressing Computational Complexity in Constructive Type The... |
ACSC
2006
IEEE
14 years 2 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
ACL
1998
13 years 9 months ago
1998
A model for reference use in communication is proposed, from a representationist point of view. Both the sender and the receiver of a message handle representations of their commo...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
ENTCS
2006
13 years 8 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...