keynote

Depending on types

Author:

Stephanie WeirichAuthors Info & Claims

ICFP '14: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming

Page 241

https://doi.org/10.1145/2628136.2631168

Published: 19 August 2014 Publication History

Get Access

Abstract

Is Haskell a dependently typed programming language? Should it be? GHC's many type-system features, such as Generalized Algebraic Datatypes (GADTs), datatype promotion, multiparameter type classes, and type families, give programmers the ability to encode domain-specific invariants in their types. Clever Haskell programmers have used these features to enhance the reasoning capabilities of static type checking. But really, how far have we come? Could we do more?

In this talk, I will discuss dependently typed programming in Haskell, through examples, analysis and comparisons with modern full-spectrum dependently typed languages, such as Coq, Agda and Idris. What sorts of dependently typed programming can be done in Haskell now? What could GHC learn from these languages? Conversely, what lessons can GHC offer in return?

Cited By

View all

Weirich SChoudhury PVoizard AEisenberg R(2019)A role for dependent types in HaskellProceedings of the ACM on Programming Languages10.1145/33417053:ICFP(1-29)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341705
Downen PSullivan ZAriola ZPeyton Jones S(2019)Codata in ActionProgramming Languages and Systems10.1007/978-3-030-17184-1_5(119-146)Online publication date: 6-Apr-2019
https://doi.org/10.1007/978-3-030-17184-1_5
Kent AKempe DTobin-Hochstadt S(2016)Occurrence typing modulo theoriesACM SIGPLAN Notices10.1145/2980983.290809151:6(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2980983.2908091
Show More Cited By

Index Terms

Depending on types
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Functional constructs
      2. Type structures

Recommendations

Depending on types
ICFP '14

Is Haskell a dependently typed programming language? Should it be? GHC's many type-system features, such as Generalized Algebraic Datatypes (GADTs), datatype promotion, multiparameter type classes, and type families, give programmers the ability to ...
A specification for dependent types in Haskell

We propose a core semantics for Dependent Haskell, an extension of Haskell with full-spectrum dependent types. Our semantics consists of two related languages. The first is a Curry-style dependently-typed language with nontermination, irrelevant ...
System FC with explicit kind equality
ICFP '13: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming

System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of System F with first-class type equality proofs called coercions. This extensible proof system forms the foundation for type system extensions such as type ...

Comments

Information & Contributors

Information

Published In

ICFP '14: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming

August 2014

390 pages

ISBN:9781450328739

DOI:10.1145/2628136

General Chair:
Johan Jeuring
Universiteit Utrecht, The Netherlands
,
Program Chair:
Manuel M.T. Chakravarty
University of New South Wales, Australia

ACM SIGPLAN Notices Volume 49, Issue 9
ICFP '14
September 2014
361 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2692915
Editors:
Mark W. Bailey
Hamilton College, Clinton, NY
,
Rajeev Balasubramonian
University of Utah
,
Al Davis
University of Utah
,
Sarita Adve
University of Illinois at Urbana-Champ
Issue’s Table of Contents

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 August 2014

Check for updates

Author Tags

Qualifiers

Keynote

Funding Sources

Division of Computing and Communication Foundations

Conference

ICFP'14

Sponsor:

SIGPLAN

ICFP'14: ACM SIGPLAN International Conference on Functional Programming

September 1 - 6, 2014

Gothenburg, Sweden

Acceptance Rates

ICFP '14 Paper Acceptance Rate 28 of 85 submissions, 33%;

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
495
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)1

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Weirich SChoudhury PVoizard AEisenberg R(2019)A role for dependent types in HaskellProceedings of the ACM on Programming Languages10.1145/33417053:ICFP(1-29)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341705
Downen PSullivan ZAriola ZPeyton Jones S(2019)Codata in ActionProgramming Languages and Systems10.1007/978-3-030-17184-1_5(119-146)Online publication date: 6-Apr-2019
https://doi.org/10.1007/978-3-030-17184-1_5
Kent AKempe DTobin-Hochstadt S(2016)Occurrence typing modulo theoriesACM SIGPLAN Notices10.1145/2980983.290809151:6(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2980983.2908091
Chen SErwig M(2016)Principal type inference for GADTsACM SIGPLAN Notices10.1145/2914770.283766551:1(416-428)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2914770.2837665
Kent AKempe DTobin-Hochstadt SKrintz CBerger E(2016)Occurrence typing modulo theoriesProceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2908080.2908091(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2908080.2908091
Chen SErwig MBodik RMajumdar R(2016)Principal type inference for GADTsProceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages10.1145/2837614.2837665(416-428)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2837614.2837665

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Depending on types

A specification for dependent types in Haskell

System FC with explicit kind equality