Eliminating Cuts in hoI(C ) - Extended Abstract
Résumé
We discuss the problem of cut elimination in an intuitionistic version of Church's Type Theory with constraints, a problem that arises in considering executable fragments suitable for logic programming.
Domaines
Informatique [cs]
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...