The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Idris, a general-purpose dependently typed programming language: Design and implementation
Open accessAbstract
Many components of a dependently typed programming language are by now well understood, for example, the underlying type theory, type checking, unification and evaluation. How to combine these components into a realistic and usable high-level language is, however, folklore, discovered anew by successive language implementors. In this paper, I describe the implementation of Idris, a new dependently typed functional programming language.Idris is intended to be a general-purpose programming language and as such provides high-level concepts such as implicit syntax, type classes and do notation. I describe the high-level language and the underlying type theory, and present a tactic-based method for elaborating concrete high-level syntax with implicit arguments and type classes into a fully explicit type theory. Furthermore, I show how this method facilitates the implementation of new high-level language constructs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Interactive Theorem Proving and Program Development
Bertot, Y., & Castéran, P. (2004) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/978-3-662-07964-5 · Cited by 1,353
Castéran, P., & Bertot, Y. (2004) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 1,084
Towards a practical programming language based on dependent type theory
Norell, U. (2007) · Cited by 555
Applicative programming with effects
MCBRIDE, C., & PATERSON, R. (2008) · Journal of Functional Programming · doi:10.1017/s0956796807006326 · Cited by 398
Simple unification-based type inference for GADTs
Peyton Jones, S., Vytiniotis, D., Weirich, S., & Washburn, G. (2006) · Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming · doi:10.1145/1159803.1159811 · Cited by 335
MCBRIDE, C., & MCKINNA, J. (2004) · Journal of Functional Programming · doi:10.1017/s0956796803004829 · Cited by 327
HUET, G. (1997) · Journal of Functional Programming · doi:10.1017/s0956796897002864 · Cited by 314
Computation and reasoning: a type theory for computer science
(1995) · Choice Reviews Online · doi:10.5860/choice.32-5698 · Cited by 241
A Tactic Language for the System Coq
Delahaye, D. (2007) · Lecture Notes in Artificial Intelligence · doi:10.1007/3-540-44404-1_7 · Cited by 190
Augustsson, L. (1985) · Lecture Notes in Computer Science · doi:10.1007/3-540-15975-4_48 · Cited by 174
Cited by
Smart contract applications within blockchain technology: a systematic mapping study
Macrinici, D., Cartofeanu, C., & Gao, S. (2018) · Telematics and Informatics · doi:10.1016/j.tele.2018.10.004 · Cited by 458
Linear Haskell: practical linearity in a higher-order polymorphic language
Bernardy, J.-P., Boespflug, M., Newton, R. R., Peyton Jones, S., & Spiwack, A. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158093 · Cited by 97
CONVENT, L., LINDLEY, S., MCBRIDE, C., & MCLAUGHLIN, C. (2020) · Journal of Functional Programming · doi:10.1017/s0956796820000039 · Cited by 39
Resource-Dependent Algebraic Effects
Brady, E. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-14675-1_2 · Cited by 18
Self-citation
Metadata
- Authors
- BRADY, E.
- Venue
- Journal of Functional Programming
- Publisher
- Cambridge University Press (CUP)
- Published
- 2013-09
- Volume
- 23
- Issue
- 5
- Pages
- 552-593
- ISSN
- 0956-7968 (ISSN-L)
- 1469-7653
- OpenAlex
- W2145108549
- Cited by
- 300
- References
- 17
- FWCI
- 27.98
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Idris, a general-purpose dependently typed programming language: Design and implementation. https://app.cochat.ai/papers/10.1017/s095679681300018x
- The paper
- BRADY, E. (2013). Idris, a general-purpose dependently typed programming language: Design and implementation. Journal of Functional Programming. https://doi.org/10.1017/s095679681300018x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.