Sequent Calculus and Equational Programming
Proof assistants and programming languages based on type theories usually come in two flavours: one L-Leucine is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in equational style.We show here that the equational approach corresponds to the use of a focused presentatio