Idris 2

Idris 2 is a purely functional programming language with first class types.

For full installation instructions, see INSTALL.md. Briefly, if you have Chez Scheme installed, with the executable name chez, type:

• make bootstrap SCHEME=chez
• make install

You may need to change chez to be the local name of your Chez Scheme. This is often one of scheme, chezscheme or chezscheme9.5 (depending on the version). On a modern desktop machine, this process (including tests) should take less than 5 minutes.

Idris 2 is mostly backwards compatible with Idris 1, with some minor exceptions. The most notable user visible differences, which might cause Idris 1 programs to fail to type check, are:

• Unbound implicit arguments are always erased, so it is a type error to attempt to pattern match on one.

• Simplified resolution of ambiguous names, which might mean you need to explicitly disambiguate more often. As a general rule, Idris 2 will be able to disambiguate between names which have different concrete return types (such as data constructors), or which have different concrete argument types (such as record projections). It may struggle to resolve ambiguities if one name requires an interface to be resolved.

• The cong function now takes its congruence explicitly as its first argument.

• Minor differences in the meaning of export modifiers private, export, and public export, which now refer to visibility of names from other namespaces rather than visibility from other files.

• Module names must match the filename in which they are defined (unless the module's name is "Main").

• Anything which uses a %language pragma in Idris 1 is likely to be different. Notably, elaborator reflection will exist, but most likely in a slightly different form because the internal details of the elaborator are different.

• The Prelude is much smaller (and easier to replace with an alternative).

• let x = val in e no longer computes with x in e, instead being essentially equivalent to (\x => e) val. This is to make the behaviour of let consistent in the presence of case and with (where it is hard to push the computation inside the case/with efficiently). Instead, you can define functions locally with let, which do have computational force, as follows:

  let x : ?
      x = val in
      e
  

Watch this space for more details and the rationale for the changes, as I get around to writing it...

Summary of new features:

• A core language based on "Quantitative Type Theory" which allows explicit annotation of erased types, and linear types.
• let bindings are now more expressive, and can be used to define pattern matching functions locally.
• Names which are in scope in a type are also always in scope in the body of the corresponding definition.
• Better inference. Holes are global to a source file, rather than local to a definition, meaning that some holes can be left in function types to be inferred by the type checker. This also gives better inference for the types of case expressions, and means fewer annotations are needed in interface declarations.
• Better type checker implementation which minimises the need for compile time evaluation.
• New Chez Scheme based back end which both compiles and runs faster than the default Idris 1 back end. (Also, optionally, Racket and Gambit can be used as targets).
• Everything works faster :).

A significant change in the implementation is that there is an intermediate language TTImp, which is essentially a desugared Idris, and is cleanly separated from the high level language which means it is potentially usable as a core language for other high level syntaxes.

Things still missing

• Disambiguation via 'with'
• Cumulativity (so we currently have Type : Type! Bear that in mind when you think you've proved something :))
• 'rewrite' doesn't yet work on dependent types
• Parts of the ide-mode, particularly syntax highlighting
• Documentation strings and HTML documentation generation
• ':search' and ':apropos' at the REPL
• Metaprogramming (reflection, partial evaluation)

Talks