2 Hits in 3.3 sec

Implementing a Category-Theoretic Framework for Typed Abstract Syntax [article]

Benedikt Ahrens, Ralph Matthes, Anders Mörtberg
2021 pre-print
This uses actions of endofunctors on functors with given source, and the corresponding notion of strong functors between actions, all formalized in UniMath using a recently developed library of bicategory  ...  Second, an existing mechanized library on ω-cocontinuous functors had to be extended by constructions and theorems necessary for constructing multi-sorted syntax.  ...  In Interactive Theorem Proving - 4th Interna- Conference on Formal Structures for Computation and Deduction, FSCD tional Conference, ITP 2013, Rennes, France, July 22-26, 2013.  ... 
doi:10.1145/3497775.3503678 arXiv:2112.06984v1 fatcat:wvq3o2ihmffpfgxhvl2ox3ctuq

Types and Terms Translated: Unrestricted Resources in Encoding Functions as Processes (Extended Version) [article]

Joseph W. N. Paulus and Daniele Nantes-Sobrinho and Jorge A. Pérez
2022 arXiv   pre-print
We define a type system based on intersection types to control resources and fail-prone computation.  ...  In , resources are split into linear and unrestricted; failures are explicit and arise from this distinction.  ...  In Naoki Kobayashi, editor, 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, July 17-24, 2021, Buenos Aires, Argentina (Virtual Conference), volume 195 of LIPIcs  ... 
arXiv:2112.01593v2 fatcat:pgmxkjsx4ffuzduwge2ltenki4