scientific article; zbMATH DE number 18655
From MaRDI portal
Publication:3976061
Recommendations
Cited in
(8)- The sequentially realizable functionals
- Game-theoretic analysis of call-by-value computation
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Comparing abstraction refinement algorithms
- scientific article; zbMATH DE number 194122 (Why is no real title available?)
- Fully abstract translations between functional languages
- scientific article; zbMATH DE number 1523049 (Why is no real title available?)
- Game theoretic analysis of call-by-value computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976061)