24 search results - page 3 / 5 » Reasoning about Idealized ALGOL Using Regular Languages |
HASKELL
2007
ACM
13 years 10 months ago
2007
ACM
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
JAIR
2006
13 years 6 months ago
2006
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
JELIA
2010
Springer
13 years 4 months ago
2010
Springer
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
UM
2005
Springer
13 years 11 months ago
2005
Springer
Inference and decision making with probabilistic user models may be infeasible on portable devices such as cell phones. We highlight the opportunity for storing and using precomput...
PPDP
2007
Springer
14 years 5 days ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...