Visible type application

DOI10.1007/978-3-662-49498-1_10MaRDI QIDQ2802481zbMATH OpenOpenAlexFDO

Authors Richard A. Eisenberg, Stephanie Weirich, Hamidhasan G. Ahmed

Publication date 26 April 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://repository.brynmawr.edu/compsci_pubs/2

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Practical type inference for arbitrary-rank types
• HMF: simple type inference for first-class polymorphism
• Polymorphic type inference with overloading and subtyping
• Hindley-Milner elaboration in applicative style (functional pearl)
• Types for Proofs and Programs

Cites work

• \textsc{OutsideIn(X)}: modular type inference with local assumptions
• A theory of type polymorphism in programming
• Associated type synonyms
• Closed type families with overlapping equations
• Complete and easy bidirectional typechecking for higher-rank polymorphism
• HLIO: mixing static and dynamic typing for information-flow control in Haskell
• scientific article; zbMATH DE number 1722663 (Why is no real title available?)
• scientific article; zbMATH DE number 3928328 (Why is no real title available?)
• Idris, a general-purpose dependently typed programming language: Design and implementation
• Practical type inference for arbitrary-rank types
• Principal Type Schemes for Modular Programs
• The Principal Type-Scheme of an Object in Combinatory Logic
• Visible type application

Cited in

(3)

• Visible type application
• Constraint handling rules with binders, patterns and generic quantification
• Deriving distributive laws for graded linear types

Describes a project that uses

Uses Software

• ML
• Haskell
• Twelf
• mini-ML
• Irdis
• Coq
• Idris
• F#

This page was built for publication: Visible type application

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