Visible Type Application

DOI10.1007/978-3-662-49498-1_10zbMath1335.68031OpenAlexW2494122154MaRDI QIDQ2802481

Richard 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)

Related Items (2)

Constraint handling rules with binders, patterns and generic quantification ⋮ Visible Type Application

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• A theory of type polymorphism in programming
• Visible Type Application
• Associated type synonyms
• HLIO: mixing static and dynamic typing for information-flow control in Haskell
• Practical type inference for arbitrary-rank types
• <scp>OutsideIn(X)</scp>Modular type inference with local assumptions
• Complete and easy bidirectional typechecking for higher-rank polymorphism
• Idris, a general-purpose dependently typed programming language: Design and implementation
• Closed type families with overlapping equations
• The Principal Type-Scheme of an Object in Combinatory Logic
• Principal Type Schemes for Modular Programs

This page was built for publication: Visible Type Application