10666 search results - page 1805 / 2134 » Quantum programming languages |
194
Voted
ACL2
2006
ACM
15 years 10 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 ...
117
click to vote
APLAS
2006
ACM
15 years 10 months ago
2006
ACM
The abstract domain of polyhedra is sufficiently expressive to be deployed in verification. One consequence of the richness of this domain is that long, possibly infinite, sequen...
129
click to vote
HASKELL
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we address the lack of extensibility of the exception type in Haskell. We propose a lightweight solution involving the use of existential types and the Typeable clas...
155
Voted
ITICSE
2006
ACM
15 years 10 months ago
2006
ACM
Current literature states that the undergraduate curriculum can no longer afford the luxury of a traditional compiler construction course. Nevertheless, there is an increasing ne...
126
Voted
SAC
2006
ACM
15 years 10 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...