128 search results - page 6 / 26 » Declarative Representation of Proof Terms |
IEEESCC
2006
IEEE
14 years 1 months ago
2006
IEEE
Service-oriented computing (SOC) is viewed as the computing paradigm of the near future, allowing for the dynamic interaction of services provided by distributed business partners...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
PLDI
2011
ACM
12 years 10 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
DEBS
2010
ACM
13 years 11 months ago
2010
ACM
Today’s organisations require techniques for automated transformation of the large data volumes they collect during their operations into operational knowledge. This requirement...
APAL
2010
13 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...