Typability in partial groupoids
P.H. Rodenburg, I. Bethke
TL;DR
This paper characterizes which partial applicative algebras can be assigned types, extending the understanding of typability in algebraic structures related to computation.
Contribution
It provides a new characterization of typable partial applicative algebras, building on previous claims by M. Kracht.
Findings
Established a formal criterion for typability in partial applicative algebras
Extended previous work by M. Kracht on algebraic typability
Clarified the structure of typable partial groupoids
Abstract
Adapting a claim of M. Kracht, we establish a characterization of the typable partial applicative algebras.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Natural Language Processing Techniques