We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
Miguel Jimenez, Tobias Lindahl, Konstantinos F. Sa...
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution ...
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...