1226 search results - page 47 / 246 » Proofs, Programs and Abstract Complexity |
168
Voted
ACL2
2006
ACM
15 years 8 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
118
click to vote
ENTCS
2008
15 years 2 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
153
Voted
TGC
2010
Springer
15 years 15 days ago
2010
Springer
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
135
Voted
POPL
2010
ACM
16 years 1 days ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
119
Voted
CONCUR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...