Polymorphic Iterable Sequential Effect Systems
18
TL;DR: This work presents an abstract polymorphic effect system parameterized by an effect quantale—an algebraic structure with well-defined properties that can model the effects of a range of existing sequential effect systems.
read more
Abstract: Effect systems are lightweight extensions to type systems that can verify a wide range of important properties with modest developer burden. But our general understanding of effect systems is limited primarily to systems where the order of effects is irrelevant. Understanding such systems in terms of a semilattice of effects grounds understanding of the essential issues, and provides guidance when designing new effect systems. By contrast, sequential effect systems -- where the order of effects is important -- lack an established algebraic structure on effects. We present an abstract polymorphic effect system parameterized by an effect quantale -- an algebraic structure with well-defined properties that can model the effects of a range of existing sequential effect systems. We define effect quantales, derive useful properties, and show how they cleanly model a variety of known sequential effect systems. We show that for most effect quantales, there is an induced general notion of iterating a sequential effect; that for systems we consider the derived iteration agrees with the manually designed iteration operators in prior work; and that this induced notion of iteration is as precise as possible when defined. We also position effect quantales with respect to work on categorical semantics for sequential effect systems, clarifying the distinctions between these systems and our own in the course of giving a thorough survey of these frameworks. Our derived iteration construct should generalize to these semantic structures, addressing limitations of that work. Finally, we consider the relationship between sequential effects and Kleene Algebras, where the latter may be used as instances of the former.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey on network forwarding in Software-Defined Networking
TL;DR: A new taxonomy for the representation of the forwarding pipeline in SDN based on core networking functionality is presented and it is shown that Boolean algebra is most widely used for the low-level representation of FTEs and facilitates the assessment of “equivalence” between F TEs.
19
Types and trace effects for object orientation
Christian Skalka
- 01 Jan 2008
TL;DR: This paper proposes an expressive type and effect inference algorithm combining polymorphism and subtyping/subeffecting constraints to obtain a flexible trace effect analysis in this setting, and shows how these techniques are applicable to Object Oriented features.
8
•Posted Content
Sequential Effect Systems with Control Operators.
TL;DR: This work gives the first account of sequential effects in the presence of general control operators, and offers a way to directly extend source-level support for sequential effect systems to real programming languages.
3
Graph IRs for Impure Higher-Order Languages (Technical Report)
Oliver Bračevac,Guannan Wei,Songlin Jia,Supun Abeysinghe,Yuxuan Jiang,Yuyan Bao,Tiark Rompf +6 more
TL;DR: The $\lambda^*_{\mathsf{G}}$ graph IR is a detailed end-to-end account of a functional language with reachability types and effects, presented in a companion report to the OOPSLA 2023 paper of the same title. Its adequacy and correctness are established through functional properties and contextual equivalence proofs.
2
Shelley: A Framework for Model Checking Call Ordering on Hierarchical Systems
C. Ferro,Tiago Cogumbreiro,Francisco Martins +2 more
TL;DR: In this article , a model checking framework called Shelley is proposed to verify the order of function calls, developed in the context of Cyber-Physical Systems (CPS), which is used to simplify the process of checking requirements expressed in a temporal logic.
2
References
Principal type-schemes for functional programs
Luis Damas,Robin Milner +1 more
- 25 Jan 1982
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage.
A Syntactic Approach to Type Soundness
TL;DR: A new approach to proving type soundness for Hindley/Milner-style polymorphic type systems by an adaptation of subject reduction theorems from combinatory logic to programming languages and the use of rewriting techniques for the specification of the language semantics is presented.
1.2K
Precise interprocedural dataflow analysis via graph reachability
Thomas Reps,Susan Horwitz,Mooly Sagiv +2 more
- 25 Jan 1995
TL;DR: The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by transforming them into a special kind of graph-reachability problem.
•Book
Residuated Lattices: An Algebraic Glimpse at Substructural Logics
Nikolaos Galatos,Peter Jipsen,Tomasz Kowalski,Hiroakira Ono +3 more
- 04 Apr 2013
TL;DR: Algebra and Substructural Logics as mentioned in this paper is a good introduction to algebraic logic and its connections to algebra and logic, where the connections between logic and algebra are shown in every level.
943
A completeness theorem for Kleene algebras and the algebra of regular events
Dexter Kozen
- 15 Jul 1991
TL;DR: A finitary axiomatization of the algebra of regular events involving only equations and equational implications that is sound for all interpretations over Kleene algebras is given.
773