Simplifying explicit subtyping coercions in a polymorphic calculus with effects
Fuente:
arXiv
Saved in:
| Main Authors: | Koprivec, Filip, Pretnar, Matija |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Higher-Order Asynchronous Effects
by: Ahman, Danel, et al.
Published: (2023)
by: Ahman, Danel, et al.
Published: (2023)
An effectful object calculus
by: Dagnino, Francesco, et al.
Published: (2025)
by: Dagnino, Francesco, et al.
Published: (2025)
Flattening subtyping by eta expansion
by: Dunfield, Jana
Published: (2024)
by: Dunfield, Jana
Published: (2024)
Minimal Session Types for the $π$-calculus (Extended Version)
by: Arslanagic, Alen, et al.
Published: (2021)
by: Arslanagic, Alen, et al.
Published: (2021)
Wiring the Pi-calculus to Denotational Semantics
by: Sakayori, Ken, et al.
Published: (2026)
by: Sakayori, Ken, et al.
Published: (2026)
Qutes: A High-Level Quantum Programming Language for Simplified Quantum Computing
by: Faro, Simone, et al.
Published: (2025)
by: Faro, Simone, et al.
Published: (2025)
Insum: Sparse GPU Kernels Simplified and Optimized with Indirect Einsums
by: Won, Jaeyeon, et al.
Published: (2025)
by: Won, Jaeyeon, et al.
Published: (2025)
S4 modal sequent calculus as intermediate logic and intermediate language
by: Caspar, Jean, et al.
Published: (2026)
by: Caspar, Jean, et al.
Published: (2026)
Abstract Interpretation-Based Data Leakage Static Analysis
by: Drobnjaković, Filip, et al.
Published: (2022)
by: Drobnjaković, Filip, et al.
Published: (2022)
CPU-less parallel execution of lambda calculus in digital logic
by: Fitchett, Harry, et al.
Published: (2026)
by: Fitchett, Harry, et al.
Published: (2026)
ProofOptimizer: Training Language Models to Simplify Proofs without Human Demonstrations
by: Gu, Alex, et al.
Published: (2025)
by: Gu, Alex, et al.
Published: (2025)
Simplified Signs
by: Bonvillian , John, et al.
Published: (2020)
by: Bonvillian , John, et al.
Published: (2020)
Simplified Signs
by: Bonvillian, John, et al.
Published: (2020)
by: Bonvillian, John, et al.
Published: (2020)
MLIR-Smith: A Novel Random Program Generator for Evaluating Compiler Pipelines
by: Ates, Berke, et al.
Published: (2026)
by: Ates, Berke, et al.
Published: (2026)
SimpliPy: A Source-Tracking Notional Machine for Simplified Python
by: Jain, Moida Praneeth, et al.
Published: (2025)
by: Jain, Moida Praneeth, et al.
Published: (2025)
Monadic type-and-effect soundness
by: Dagnino, Francesco, et al.
Published: (2025)
by: Dagnino, Francesco, et al.
Published: (2025)
Land Patch Samples
by: Šircelj, Beno, et al.
Published: (2020)
by: Šircelj, Beno, et al.
Published: (2020)
Formally Verifiable Generated ASN.1/ACN Encoders and Decoders: A Case Study
by: Bucev, Mario, et al.
Published: (2024)
by: Bucev, Mario, et al.
Published: (2024)
Simplifying Safety Proofs with Forward-Backward Reasoning and Prophecy
by: Frenkel, Eden, et al.
Published: (2026)
by: Frenkel, Eden, et al.
Published: (2026)
Strong Dinatural Transformations and Generalised Codensity Monads
by: Piróg, Maciej, et al.
Published: (2025)
by: Piróg, Maciej, et al.
Published: (2025)
Modular probabilistic programming with algebraic effects (MSc Thesis 2019)
by: Goldstein, Oliver, et al.
Published: (2024)
by: Goldstein, Oliver, et al.
Published: (2024)
Ohana trees, linear approximation and multi-types for the $λ$I-calculus: No variable gets left behind or forgotten!
by: Cerda, Rémy, et al.
Published: (2025)
by: Cerda, Rémy, et al.
Published: (2025)
Rel: A Programming Language for Relational Data
by: Aref, Molham, et al.
Published: (2025)
by: Aref, Molham, et al.
Published: (2025)
Linear effects, exceptions, and resource safety: a Curry-Howard correspondence for destructors
by: Congard, Sidney, et al.
Published: (2025)
by: Congard, Sidney, et al.
Published: (2025)
A graph-based analysis of semantic types and coercion in contextualized word embeddings
by: Chen, Long, et al.
Published: (2026)
by: Chen, Long, et al.
Published: (2026)
Demonstrating a Future for MLIR-native DSL Compilers on a NumPy-like Example
by: Friebel, Karl F. A., et al.
Published: (2026)
by: Friebel, Karl F. A., et al.
Published: (2026)
Increasing the Expressiveness of a Gradual Verifier
by: Gupta, Priyam
Published: (2025)
by: Gupta, Priyam
Published: (2025)
Multiparty Session Types with a Bang!
by: Brun, Matthew Alan Le, et al.
Published: (2025)
by: Brun, Matthew Alan Le, et al.
Published: (2025)
Exo 2: Growing a Scheduling Language
by: Ikarashi, Yuka, et al.
Published: (2024)
by: Ikarashi, Yuka, et al.
Published: (2024)
Broadening the View of Live Programmers: Integrating a Cross-Cutting Perspective on Run-Time Behavior into a Live Programming Environment
by: Rein, Patrick, et al.
Published: (2024)
by: Rein, Patrick, et al.
Published: (2024)
E-Graphs as a Persistent Compiler Abstraction
by: Merckx, Jules, et al.
Published: (2026)
by: Merckx, Jules, et al.
Published: (2026)
Compilation Semantics for a Programming Language with Versions
by: Tanabe, Yudai, et al.
Published: (2023)
by: Tanabe, Yudai, et al.
Published: (2023)
Lazy Linearity for a Core Functional Language
by: Mesquita, Rodrigo, et al.
Published: (2025)
by: Mesquita, Rodrigo, et al.
Published: (2025)
Crux, a Precise Verifier for Rust and Other Languages
by: Pernsteiner, Stuart, et al.
Published: (2024)
by: Pernsteiner, Stuart, et al.
Published: (2024)
The Incredible Shrinking Context... in a Decompiler Near You
by: Lagouvardos, Sifis, et al.
Published: (2024)
by: Lagouvardos, Sifis, et al.
Published: (2024)
A Coq implementation of a Theory of Tagged Objects
by: Gates, Matthew, et al.
Published: (2025)
by: Gates, Matthew, et al.
Published: (2025)
Soteria: Efficient Symbolic Execution as a Functional Library
by: Ayoun, Sacha-Élie, et al.
Published: (2025)
by: Ayoun, Sacha-Élie, et al.
Published: (2025)
Beyond SICP -- Design and Implementation of a Notional Machine for Scheme
by: Abad, Kyriel, et al.
Published: (2024)
by: Abad, Kyriel, et al.
Published: (2024)
Minuska: Towards a Formally Verified Programming Language Framework
by: Tušil, Jan, et al.
Published: (2024)
by: Tušil, Jan, et al.
Published: (2024)
With a Few Square Roots, Quantum Computing is as Easy as Π
by: Carette, Jacques, et al.
Published: (2023)
by: Carette, Jacques, et al.
Published: (2023)
Similar Items
-
Higher-Order Asynchronous Effects
by: Ahman, Danel, et al.
Published: (2023) -
An effectful object calculus
by: Dagnino, Francesco, et al.
Published: (2025) -
Flattening subtyping by eta expansion
by: Dunfield, Jana
Published: (2024) -
Minimal Session Types for the $π$-calculus (Extended Version)
by: Arslanagic, Alen, et al.
Published: (2021) -
Wiring the Pi-calculus to Denotational Semantics
by: Sakayori, Ken, et al.
Published: (2026)