Functors are type refinement systems
DOI10.1145/2676726.2676970zbMATH Open1345.68112OpenAlexW2010912446MaRDI QIDQ2819783FDOQ2819783
Paul-André Melliès, Noam Zeilberger
Publication date: 29 September 2016
Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01096910/file/funts.pdf
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Categorical logic, topoi (03G30) Categorical semantics of formal languages (18C50) Functional programming and lambda calculus (68N18)
Cited In (13)
- An Isbell duality theorem for type refinement systems
- Title not available (Why is that?)
- A fibrational tale of operational logical relations: pure, effectful and differential
- A general semantic construction of dependent refinement type systems, categorically
- Graded Hoare logic and its categorical semantics
- Weakest preconditions in fibrations
- Bifibrations of polycategories and classical linear logic
- Weakest preconditions in fibrations
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- A functorial excursion between algebraic geometry and linear logic
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- Codensity Lifting of Monads and its Dual
- From semantics to types: the case of the imperative \(\lambda\)-calculus
This page was built for publication: Functors are type refinement systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819783)
