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