All Stories

  1. Deltas for Functional Programs with Algebraic Data Types
  2. Variability modules
  3. FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC
  4. On logical and extensional characterizations of attributed feature models
  5. Efficient static analysis and verification of featured transition systems
  6. Variability modules for Java-like languages
  7. Static analysis and family-based model checking of featured transition systems with VMC
  8. Splitting Recursion Schemes into Reversible and Classical Interacting Threads
  9. On the Expressivity of Total Reversible Programming Languages
  10. On Slicing Software Product Line Signatures
  11. On Two Characterizations of Feature Models
  12. A class of Recursive Permutations which is Primitive Recursive complete
  13. The fixed point problem of a simple reversible language
  14. Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form
  15. Quantum Programming Made Easy
  16. QPCF: Higher-Order Languages and Quantum Circuits
  17. A formal model for Multi Software Product Lines
  18. On the expressiveness of modal transition systems with variability constraints
  19. Static analysis of featured transition systems
  20. Summary of: On the Expressiveness of Modal Transition Systems with Variability Constraints
  21. On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions
  22. Multi Software Product Lines in the Wild
  23. A Formal Model for Multi SPLs
  24. $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations
  25. A Class of Reversible Primitive Recursive Functions
  26. Essential and relational models
  27. From Featured Transition Systems to Modal Transition Systems with Variability Constraints
  28. On the reification of semantic linearity
  29. Proceedings Sixth Workshop on Intersection Types and Related Systems
  30. Call-by-Value Solvability, Revisited
  31. Preface
  32. Linearity and PCF
  33. Linearity and PCF: a semantic insight!
  34. Strong normalization from an unusual point of view
  35. Logical Semantics for Stability
  36. A Process-Model for Linear Programs
  37. Semantically linear programming languages
  38. Parametric λ -theories
  39. A stable programming language
  40. An Operational Characterization of Strong Normalization
  41. Lazy Strong Normalization
  42. Lazy Logical Semantics
  43. Parametric parameter passing λ-calculus
  44. Further Reading
  45. Further Reading
  46. Representing Functions
  47. Further Reading
  48. Preliminaries
  49. Parametric Operational Semantics
  50. Operational Extensionality
  51. λΔ-Models
  52. The Parametric Lambda Calculus
  53. The Parametric λ-Calculus
  54. Filter λΔ-Models and Domains
  55. Call-by-Name Operational Semantics
  56. Call-by-Value Denotational Semantics
  57. The Call-by-Value λ-Calculus
  58. The Call-by-Name λ-Calculus
  59. Call-by-Value Operational Semantics
  60. Call-by-Name Denotational Semantics
  61. Call-by-Value Separability and Computability
  62. Call-by-value Solvability