Entity usage

Showing below up to 33 results in range #1 to #33.

1. Partial type equivalences for verified dependent interoperability: Label: en
2. Elaborator reflection: extending Idris in Idris: Label: en
3. Unifiers as equivalences: proof-relevant unification of dependently typed data: Label: en
4. Higher-order ghost state: Label: en
5. Automatically disproving fair termination of higher-order functional programs: Label: en
6. Dynamic witnesses for static type errors (or, ill-typed programs usually go wrong): Label: en
7. String diagrams for free monads (functional pearl): Label: en
8. Combining effects and coeffects via grading: Label: en
9. Context-free session types: Label: en
10. The best of both worlds: linear functional programming without compromise: Label: en
11. Talking bananas: structural recursion for session types: Label: en
12. A fully concurrent garbage collector for functional programs on multicore processors: Label: en
13. Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis: Label: en
14. Hierarchical memory management for parallel programs: Label: en
15. Set-theoretic types for polymorphic variants: Label: en
16. Disjoint intersection types: Label: en
17. Indexed codata types: Label: en
18. Ghostbuster: a tool for simplifying and converting GADTs: Label: en
19. An abstract memory functor for verified C static analyzers: Label: en
20. Constructive Galois connections: taming the Galois connection framework for mechanized metatheory: Label: en
21. Datafun: a functional Datalog: Label: en
22. Experience report: growing and shrinking polygons for random testing of computational geometry algorithms: Label: en
23. All sorts of permutations (functional pearl): Label: en
24. Queueing and glueing for optimal partitioning (functional pearl): Label: en
25. Compact bit encoding schemes for simply-typed lambda-terms: Label: en
26. A type theory for incremental computational complexity with control flow changes: Label: en
27. Fully abstract compilation via universal embedding: Label: en
28. Refinement through restraint: bringing down the cost of verification: Label: en
29. Sequent calculus as a compiler intermediate language: Label: en
30. Deriving a probability density calculator (functional pearl): Label: en
31. A lambda-calculus foundation for universal probabilistic programming: Label: en
32. Dag-calculus: a calculus for parallel computation: Label: en
33. Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms: Label: en