Eliminating Cuts in hoI(C ) - Extended Abstract

Olivier Hermant (1, 2) , James Lipton (3)

1 CRI - Centre de Recherche en Informatique
2 Mines Paris - PSL (École nationale supérieure des mines de Paris)
3 Wesleyan University

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]

Olivier Hermant, James Lipton. Eliminating Cuts in hoI(C ) - Extended Abstract. TEASE-LP: Workshop on Trends, Extensions, Applications and Semantics of Logic Programming, May 2020, Paris, France. ⟨hal-02958328⟩