An effective theory of type refinements

DOI10.1145/944705.944725zbMATH Open1315.68055OpenAlexW2032687731MaRDI QIDQ5261277FDOQ5261277

Author name not available (Why is that?)

Publication date: 2 July 2015

Published in: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/944705.944725

zbMATH Keywords

linear logictype theorylocal reasoningeffectful computationtype refinement

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Cited In (10)

• ν-Types for Effects and Freshness Analysis
• Title not available (Why is that?)
• Refining inductive types
• Title not available (Why is that?)
• Types and trace effects for object orientation
• Static typing for a substructural lambda calculus
• Shallow embedding of type theory is morally correct
• Title not available (Why is that?)
• Programming Languages and Systems
• Hoare type theory, polymorphism and separation

This page was built for publication: An effective theory of type refinements

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