A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper presents a dependently-typed programming language that uses an adaptation of a congruence closure algorithm for proof and type inference. While most dependently-typed languages automatically use equalities that follow from β-reductions but do not automatically use known assumptions from the context, our language does the opposite. It uses assumptions but does not automatically reduce expressions. Our work includes the specification of the language via a bidirectional type system,doi:10.1145/2775051.2676974 fatcat:sffkvxua7zezxn7yegrijtyz6u