Some Algebraic Structures in Lambda-Calculus with Inductive Types

Sergei Soloviev (1) , David Chemouil (2)

1 IRIT-ACADIE - Assistance à la Certification d’Applications DIstribuées et Embarquées
2 ONERA - The French Aerospace Lab [Toulouse]

This paper is part of a research project where we are exploring methods to extend the computational content of various systems of typed λ-calculus adding new reductions. Our previous study had its focus on isomorphisms of simple inductive types and related extensions of term rewriting. In this paper we present some new results concerning representation of finite sets as inductive types and related algebraic structures.

Domaines: Logique en informatique [cs.LO]

Sergei Soloviev, David Chemouil. Some Algebraic Structures in Lambda-Calculus with Inductive Types. International Workshop on Types for Proofs and Programs (TYPES 2003), Apr 2003, Torino, Italy. pp.338-354, ⟨10.1007/978-3-540-24849-1_22⟩. ⟨hal-00782718⟩