Genericity Through Stratification
Fuente:
arXiv
Saved in:
| Main Authors: | Arrial, Victor, Guerrieri, Giulio, Kesner, Delia |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Node Replication: Theory And Practice
by: Kesner, Delia, et al.
Published: (2022)
by: Kesner, Delia, et al.
Published: (2022)
Extending the Quantitative Pattern-Matching Paradigm
by: Alves, Sandra, et al.
Published: (2024)
by: Alves, Sandra, et al.
Published: (2024)
AdapTT: Functoriality for Dependent Type Casts
by: Adjedj, Arthur, et al.
Published: (2025)
by: Adjedj, Arthur, et al.
Published: (2025)
Definitional Functoriality for Dependent (Sub)Types -- Extended version
by: Laurent, Théo, et al.
Published: (2023)
by: Laurent, Théo, et al.
Published: (2023)
What does it take to certify a conversion checker?
by: Lennon-Bertrand, Meven
Published: (2025)
by: Lennon-Bertrand, Meven
Published: (2025)
Separation Logic of Generic Resources via Sheafeology
by: van Starkenburg, Berend, et al.
Published: (2025)
by: van Starkenburg, Berend, et al.
Published: (2025)
Generically Automating Separation Logic by Functors, Homomorphisms and Modules
by: Xu, Qiyuan, et al.
Published: (2024)
by: Xu, Qiyuan, et al.
Published: (2024)
Infinitary Refinement Types for Temporal Properties in Scott Domains
by: Riba, Colin, et al.
Published: (2025)
by: Riba, Colin, et al.
Published: (2025)
Explicit Weakening
by: Wadler, Philip
Published: (2024)
by: Wadler, Philip
Published: (2024)
Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
by: Accattoli, Beniamino, et al.
Published: (2025)
by: Accattoli, Beniamino, et al.
Published: (2025)
Verified VCG and Verified Compiler for Dafny
by: Nezamabadi, Daniel, et al.
Published: (2025)
by: Nezamabadi, Daniel, et al.
Published: (2025)
Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)
by: Abdulla, Parosh Aziz, et al.
Published: (2023)
The Lambda Calculus is Quantifiable
by: Maestracci, Valentin, et al.
Published: (2024)
by: Maestracci, Valentin, et al.
Published: (2024)
Intersection Types for a Computational Lambda-Calculus with Global State
by: de'Liguoro, Ugo, et al.
Published: (2021)
by: de'Liguoro, Ugo, et al.
Published: (2021)
Abstract clones for abstract syntax
by: Arkor, Nathanael, et al.
Published: (2021)
by: Arkor, Nathanael, et al.
Published: (2021)
The Denotational Semantics of SSA
by: Ghalayini, Jad Elkhaleq, et al.
Published: (2024)
by: Ghalayini, Jad Elkhaleq, et al.
Published: (2024)
On Modular Termination Proofs of General Logic Programs
by: Bossi, Annalisa, et al.
Published: (2000)
by: Bossi, Annalisa, et al.
Published: (2000)
LeanLTL: A unifying framework for linear temporal logics in Lean
by: Vin, Eric, et al.
Published: (2025)
by: Vin, Eric, et al.
Published: (2025)
Verifying Tree-Manipulating Programs via CHCs
by: Faella, Marco, et al.
Published: (2025)
by: Faella, Marco, et al.
Published: (2025)
Sequence-Based Abstract Interpretation of Prolog
by: Charlier, Baudouin Le, et al.
Published: (2000)
by: Charlier, Baudouin Le, et al.
Published: (2000)
Bisimilarity and Simulatability of Processes Parameterized by Join Interactions
by: Grabmayer, Clemens, et al.
Published: (2025)
by: Grabmayer, Clemens, et al.
Published: (2025)
Multisets and Distributions
by: Kozen, Dexter, et al.
Published: (2023)
by: Kozen, Dexter, et al.
Published: (2023)
Uniform Substitution for Differential Refinement Logic
by: Prebet, Enguerrand, et al.
Published: (2024)
by: Prebet, Enguerrand, et al.
Published: (2024)
Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
by: Waldinger, Richard
Published: (2025)
by: Waldinger, Richard
Published: (2025)
Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
by: Prebet, Enguerrand, et al.
Published: (2026)
by: Prebet, Enguerrand, et al.
Published: (2026)
A Graded Modal Type Theory for Pulse Schedules
by: Adams, Robin, et al.
Published: (2025)
by: Adams, Robin, et al.
Published: (2025)
Simple Types for Polymorphic Functions
by: Jay, Barry, et al.
Published: (2026)
by: Jay, Barry, et al.
Published: (2026)
Conformance Games for Graded Semantics
by: Forster, Jonas, et al.
Published: (2024)
by: Forster, Jonas, et al.
Published: (2024)
Modelling Recursion and Probabilistic Choice in Guarded Type Theory
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)
Forall-Exists Relational Verification by Filtering to Forall-Forall
by: Nagasamudram, Ramana, et al.
Published: (2025)
by: Nagasamudram, Ramana, et al.
Published: (2025)
Bayesian Separation Logic
by: Ho, Shing Hin, et al.
Published: (2025)
by: Ho, Shing Hin, et al.
Published: (2025)
Semantics out of context: nominal absolute denotations for first-order logic and computation
by: Gabbay, Murdoch J.
Published: (2013)
by: Gabbay, Murdoch J.
Published: (2013)
Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops
by: Zaiser, Fabian, et al.
Published: (2024)
by: Zaiser, Fabian, et al.
Published: (2024)
Well-Scoped Locally Nameless Representation of Syntax
by: Pitts, Andrew M.
Published: (2026)
by: Pitts, Andrew M.
Published: (2026)
One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics
by: Bisping, Benjamin, et al.
Published: (2024)
by: Bisping, Benjamin, et al.
Published: (2024)
Interpreting De Finetti's theorem in the Category of Integrable Cones (long version)
by: Raphaëlle, Crubillé
Published: (2026)
by: Raphaëlle, Crubillé
Published: (2026)
A Fibrational Perspective on Differential Linear Logic
by: Koleilat, Jad
Published: (2026)
by: Koleilat, Jad
Published: (2026)
On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
by: Lago, Ugo Dal, et al.
Published: (2026)
by: Lago, Ugo Dal, et al.
Published: (2026)
Relational Dualities and Bisimulation
by: Kozicki, Piotr, et al.
Published: (2026)
by: Kozicki, Piotr, et al.
Published: (2026)
The General and Finite Satisfiability Problems for PCTL are Undecidable
by: Chodil, Miroslav, et al.
Published: (2024)
by: Chodil, Miroslav, et al.
Published: (2024)
Similar Items
-
Node Replication: Theory And Practice
by: Kesner, Delia, et al.
Published: (2022) -
Extending the Quantitative Pattern-Matching Paradigm
by: Alves, Sandra, et al.
Published: (2024) -
AdapTT: Functoriality for Dependent Type Casts
by: Adjedj, Arthur, et al.
Published: (2025) -
Definitional Functoriality for Dependent (Sub)Types -- Extended version
by: Laurent, Théo, et al.
Published: (2023) -
What does it take to certify a conversion checker?
by: Lennon-Bertrand, Meven
Published: (2025)