1670 search results - page 7 / 334 » On Skolemization in constructive theories |
JSYML
2006
13 years 6 months ago
2006
Abstract. We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-L
TYPES
2000
Springer
13 years 10 months ago
2000
Springer
We present a formalization of the halting problem in Agda, a language based on Martin-L
PLPV
2009
ACM
14 years 3 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
APAL
2006
13 years 6 months ago
2006
For a long time people have been trying to develop probability theory starting from `finite' events rather than collections of infinite events. In this way one can find natura...
TEI
2009
ACM
14 years 1 months ago
2009
ACM
Graphs are a versatile representation of many systems in computer science, the social sciences, and mathematics, but graph theory is not taught in schools. We present our work on ...