6829 search results - page 292 / 1366 » Quantitative Generalizations of Languages |
295
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
293
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
292
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
198
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
143
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...