A general semantic construction of dependent refinement type systems, categorically

DOI10.1007/978-3-030-71995-1_21OpenAlexW3141317606MaRDI QIDQ2233424FDOQ2233424

Authors: Satoshi Kura 

Publication date: 18 October 2021

Full work available at URL: https://arxiv.org/abs/2010.08280

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites Work

• Refinement types for Haskell
• Secure distributed programming with value-dependent types
• Categorical logic and type theory
• Notions of computation and monads
• Title not available (Why is that?)
• Hybrid type checking
• Parametric effect monads and semantics of effect systems
• Weakest preconditions in fibrations
• Functors are type refinement systems
• Gradual refinement types
• Towards a formal theory of graded monads
• Dependent types and fibred computational effects
• Higher-order approximate relational refinement types for mechanism design and differential privacy
• Abstract refinement types

Cited In (2)

• Extensional and Intensional Semantic Universes
• Title not available (Why is that?)

This page was built for publication: A general semantic construction of dependent refinement type systems, categorically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233424)