Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Oxidizing OCaml with modal memory management
A Lorenzen, L White, S Dolan, RA Eisenberg… - Proceedings of the …, 2024 - dl.acm.org
Programmers can often improve the performance of their programs by reducing heap
allocations: either by allocating on the stack or reusing existing memory in-place. However …
allocations: either by allocating on the stack or reusing existing memory in-place. However …
Functional Ownership through Fractional Uniqueness
Ownership and borrowing systems, designed to enforce safe memory management without
the need for garbage collection, have been brought to the fore by the Rust programming …
the need for garbage collection, have been brought to the fore by the Rust programming …
Parameterized Algebraic Protocols
We propose algebraic protocols that enable the definition of protocol templates and session
types analogous to the definition of domain-specific types with algebraic datatypes …
types analogous to the definition of domain-specific types with algebraic datatypes …
Law and Order for Typestate with Borrowing
Typestate systems are notoriously complex as they require sophisticated machinery for
tracking aliasing. We propose a new, transition-oriented foundation for typestate in the …
tracking aliasing. We propose a new, transition-oriented foundation for typestate in the …
Destination-passing style programming: a Haskell implementation
T Bagrel - arxiv preprint arxiv:2312.11257, 2023 - arxiv.org
Destination-passing style programming introduces destinations, which represent the
address of a write-once memory cell. Those destinations can be passed as function …
address of a write-once memory cell. Those destinations can be passed as function …
[HTML][HTML] Non-linear communication via graded modal session types
D Marshall, D Orchard - Information and Computation, 2024 - Elsevier
Session types provide guarantees about concurrent behaviour and can be understood
through their correspondence with linear logic, with propositions as sessions and proofs as …
through their correspondence with linear logic, with propositions as sessions and proofs as …
[PDF][PDF] Static Uniqueness Analysis for the Lean 4 Theorem Prover
M Huisinga - pp.ipd.kit.edu
Abstract Der Lean 4 Theorembeweiser, welcher auch als vollwertige Programmiersprache
verwendbar ist, implementiert eine auf Referenzzählung basierende Optimierung, die das …
verwendbar ist, implementiert eine auf Referenzzählung basierende Optimierung, die das …