220 search results - page 32 / 44 » Coq Modulo Theory |
142
click to vote
PEPM
2007
ACM
16 years 7 months ago
2007
ACM
programming languages community is vigorously pursuing ways to incorporate F!-style indexed types into programming languages. This paper advocates Concoqtion, a practical approach ...
166
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
MKM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. There are many styles for the narrative structure of a mathematical document. Each mathematician has its own conventions and traditions about labeling portions of texts (...
PROVSEC
2007
Springer
15 years 3 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
CSFW
2010
IEEE
15 years 1 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...