Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

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

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. A non-deterministic call-by-need lambda calculus: Label: en
  2. Intensional polymorphism in type-erasure semantics: Label: en
  3. Encoding types in ML-like languages: Label: en
  4. Fold and unfold for program semantics: Label: en
  5. The under-appreciated unfold: Label: en
  6. Recycling continuations: Label: en
  7. Cayenne—a language with dependent types: Label: en
  8. A framework for type inference with subtyping: Label: en
  9. Pragmatic subtyping in polymorphic languages: Label: en
  10. A distributed garbage collector with diffusion tree reorganisation and mobile objects: Label: en
  11. Functional differentiation of computer programs: Label: en
  12. Lazy computation with exact real numbers: Label: en
  13. The spineless tagless G-machine, naturally: Label: en
  14. Typed cross-module compilation: Label: en
  15. YALE: Label: en
  16. Programming with variable functions: Label: en
  17. PLAN: Label: en
  18. A theory of core fudgets: Label: en
  19. The marriage of effects and monads: Label: en
  20. Taming effects with monadic typing: Label: en
  21. A type based sharing analysis for update avoidance and optimisation: Label: en
  22. Higher-order arity raising: Label: en
  23. Building program optimizers with rewriting strategies: Label: en
  24. On the runtime complexity of type-directed unboxing: Label: en
  25. A non-deterministic call-by-need lambda calculus: Label: en
  26. Intensional polymorphism in type-erasure semantics: Label: en
  27. Fold and unfold for program semantics: Label: en
  28. The under-appreciated unfold: Label: en
  29. Imperative streams—a monadic combinator library for synchronous programming: Label: en
  30. Cayenne—a language with dependent types: Label: en
  31. A framework for type inference with subtyping: Label: en
  32. Pragmatic subtyping in polymorphic languages: Label: en
  33. Functional differentiation of computer programs: Label: en
  34. Lazy computation with exact real numbers: Label: en
  35. The spineless tagless G-machine, naturally: Label: en
  36. Typed cross-module compilation: Label: en
  37. Compiling standard ML to Java bytecodes: Label: en
  38. YALE: Label: en
  39. Programming with variable functions: Label: en
  40. A theory of core fudgets: Label: en
  41. The marriage of effects and monads: Label: en
  42. Taming effects with monadic typing: Label: en
  43. A type based sharing analysis for update avoidance and optimisation: Label: en
  44. Higher-order arity raising: Label: en
  45. On the runtime complexity of type-directed unboxing: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)