COCHIS: Stable and coherent implicits
From MaRDI portal
Publication:4972074
DOI10.1017/S0956796818000242zbMath1493.68094OpenAlexW2912261953WikidataQ128437207 ScholiaQ128437207MaRDI QIDQ4972074
Koar Marntirosian, Tom Schrijvers, Philip Wadler, Bruno C. d. S. Oliveira
Publication date: 22 November 2019
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796818000242
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Focusing and polarization in linear, intuitionistic, and classical logics
- The lambda calculus, its syntax and semantics
- Inheritance as implicit coercion
- Unification under a mixed prefix
- A theory of type polymorphism in programming
- Uniform proofs as a foundation for logic programming
- Associated type synonyms
- Modular type classes
- Practical type inference for arbitrary-rank types
- Understanding functional dependencies via constraint handling rules
- First-Class Type Classes
- Dependently Typed Programming in Agda
- A Deductive Approach to Program Synthesis
- An Efficient Unification Algorithm
- Logic Programming with Focusing Proofs in Linear Logic
- Qualified Types
- <scp>OutsideIn(X)</scp>Modular type inference with local assumptions
- The coherence of languages with intersection types
- Propositions as sessions
- Instance chains
- On the bright side of type classes
- How to make ad hoc proof automation less ad hoc
- Type checking with open type functions
- HMF
- FPH
- Implicit parameters
- Complete and easy bidirectional typechecking for higher-rank polymorphism
- ML F
- Associated types with class
- An extended comparative study of language support for generic programming
- Closed type families with overlapping equations
- The Principal Type-Scheme of an Object in Combinatory Logic
