90 search results - page 6 / 18 » General directionality and the local behavior of argumentati... |
158
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
176
click to vote
JUCS
2006
15 years 6 months ago
2006
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
160
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
206
click to vote
JASIS
2011
15 years 1 months ago
2011
We describe two general approaches to creating document-level maps of science. To create a local map one defines and directly maps a sample of data, such as all literature publish...
167
click to vote
IWMM
2009
Springer
16 years 25 days ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...