1226 search results - page 22 / 246 » Proofs, Programs and Abstract Complexity |
131
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
104
click to vote
ESOP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
114
click to vote
LPAR
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
147
click to vote
CLIMA
2004
15 years 3 months ago
2004
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
136
click to vote
PADL
2007
Springer
15 years 8 months ago
2007
Springer
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...