797 search results - page 9 / 160 » Eliminating Proofs from Programs |
106
click to vote
TABLEAUX
1995
Springer
15 years 1 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
ESOP
2010
Springer
15 years 6 months ago
2010
Springer
IANDC
2010
14 years 8 months ago
2010
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
CSFW
1998
IEEE
15 years 1 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...