6978 search results - page 205 / 1396 » On Proofs in System P |
171
click to vote
RTA
2007
Springer
16 years 20 days ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
159
click to vote
JSYML
2002
15 years 6 months ago
2002
In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the u...
174
click to vote
MSS
2005
IEEE
16 years 4 days ago
2005
IEEE
Modern storage systems are responsible for increasing amounts of data and the value of the data itself is growing in importance. Several primary storage system solutions have emer...
192
click to vote
ESOP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
155
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...