Proof systems for retracts in simply typed lambda calculus

Authors:
Colin Stirling
Affiliations:
School of Informatics, University of Edinburgh, UK
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Year:
2013

Citing 10
Cited 0

Provable isomorphisms and domain equations in models of typed languages

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
The "Hardest'' Natural Decidable Theory

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Decidability of fourth-order matching

Mathematical Structures in Computer Science
On Model-Checking Trees Generated by Higher-Order Recursion Schemes

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Higher-Order Matching, Games and Automata

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On the building of affine retractions

Mathematical Structures in Computer Science
Dependency Tree Automata

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Functional Reachability

LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Retracts in simple types

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concerns retracts in simply typed lambda calculus assuming βη-equality. We provide a simple tableau proof system which characterises when a type is a retract of another type and which leads to an exponential decision procedure.