Retracts in simple types

Authors:
Vincent Padovani
Affiliations:
CNRS, Université Paris 7
Venue:
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Year:
2001

Citing 3
Cited 4

Provable isomorphisms and domain equations in models of typed languages

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Decidability of behavioural equivalence in unary PCF

Theoretical Computer Science
Decidability of All Minimal Models

TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs

Foreword

Mathematical Structures in Computer Science
Classical isomorphisms of types

Mathematical Structures in Computer Science
On the building of affine retractions

Mathematical Structures in Computer Science
Proof systems for retracts in simply typed lambda calculus

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we prove the decidability of the existence of a definable retraction between two given simple types. Instead of defining some extension of a former type system from which these retractions could be inferred, we obtain this result as a corollary of the decidability of the minimal model of simply typed λ-calculus.