1948 search results - page 336 / 390 » Formalizing Mirror Theory |
TLDI
2003
ACM
14 years 3 months ago
2003
ACM
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
PLDI
2010
ACM
14 years 3 months ago
2010
ACM
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...
WIKIS
2009
ACM
14 years 2 months ago
2009
ACM
Learning “the wiki way”, learning through wikis is a form of selfregulated learning that is independent of formal learning settings and takes place in a community of knowledge...
ASYNC
2000
IEEE
14 years 2 months ago
2000
IEEE
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
CIE
2010
Springer
14 years 1 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...