Abstract
The logical technique of focusing can be applied to the λ-calculus; in a simple type system with atomic types and negative type formers (functions, products, the unit type), its normal forms coincide with βη-normal forms. Introducing a saturation phase gives a notion of quasi-normal forms in presence of positive types (sum types and the empty type). This rich structure let us prove the decidability of βη-equivalence in presence of the empty type, the fact that it coincides with contextual equivalence, and with set-theoretic equality in all finite models.
- Arbob Ahmad, Daniel R. Licata, and Robert Harper. Deciding coproduct equality with focusing. Online draft, 2010.Google Scholar
- Thorsten Altenkirch and Tarmo Uustalu. Normalization by evaluation for lambda-2. In FLOPS, 2004.Google Scholar
- Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, and Philip J. Scott. Normalization by evaluation for typed lambda calculus with coproducts. In LICS, 2001. Google Scholar
Digital Library
- Jean-Marc Andreoli. Logic Programming with Focusing Proof in Linear Logic. Journal of Logic and Computation, 2(3), 1992.Google Scholar
- Vincent Balat, Roberto Di Cosmo, and Marcelo P. Fiore. Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In POPL, 2004. Google Scholar
Digital Library
- Corrado Böhm. Alcune proprieta delle forme normali nel k-calcolo. IAC Pubbl, 696119, 1968.Google Scholar
- Kaustuv Chaudhuri, Dale Miller, and Alexis Saurin. Canonical sequent proofs via multi-focusing. In IFIP TCS, 2008a.Google Scholar
Cross Ref
- Kaustuv Chaudhuri, Frank Pfenning, and Greg Price. A logical characterization of forward and backward chaining in the inverse method. J. Autom. Reasoning, 40(2-3), 2008b. Google Scholar
Digital Library
- Kaustuv Chaudhuri, Stefan Hetzl, and Dale Miller. A Systematic Approach to Canonicity in the Classical Sequent Calculus. In CSL, 2012.Google Scholar
- Pierre-Louis Curien, Marcelo Fiore, and Guillaume Munch-Maccagnoni. A Theory of Effects and Resources: Adjunction Models and Polarised Calculi. In Proc. POPL, 2016. Google Scholar
Digital Library
- Daniel J Dougherty and Ramesh Subrahmanyam. Equality between functionals in the presence of coproducts. Information and Computation, 157 (1), 2000. Google Scholar
Digital Library
- Marcelo Fiore and Alex Simpson. Lambda definability with sums via grothendieck logical relations. In TLCA, 1999. Google Scholar
Digital Library
- Harvey Friedman. Equality between functionals. In Logic Colloquium, 1975.Google Scholar
Cross Ref
- Neil Ghani. Beta-Eta Equality for Coproducts. In TLCA, 1995. Google Scholar
Digital Library
- Danko Ilik. The exp-log normal form of types and canonical terms for lambda calculus with sums. CoRR, arxiv:1502.04634, 2015. URL http://arxiv.org/abs/1502.04634.Google Scholar
- Chuck Liang and Dale Miller. Focusing and polarization in intuitionistic logic. CoRR, arxiv:0708.2252, 2007. URL http://arxiv.org/abs/0708.2252. Google Scholar
Digital Library
- Sam Lindley. Extensional rewriting with sums. In TLCA, 2007. Google Scholar
Digital Library
- Guillaume Munch-Maccagnoni and Gabriel Scherer. Polarised Intermediate Representation of Lambda Calculus with Sums. In LICS, 2015. Google Scholar
Digital Library
- Gabriel Scherer. Which types have a unique inhabitant? Focusing on pure program equivalence. PhD thesis, Université Paris-Diderot, 2016.Google Scholar
- Gabriel Scherer and Didier Rémy. Which simple types have a unique inhabitant? In ICFP, 2015. Google Scholar
Digital Library
- Robert J. Simmons. Structural focalization. CoRR, arxiv:1109.6273, 2011. URL http://arxiv.org/abs/1109.6273.Google Scholar
- Alex Simpson. Categorical completeness results for the simply-typed lambda-calculus. In TLCA, 1995. Google Scholar
Digital Library
- Richard Statman. Completeness, equivalence and lambda-definability. Journal of Symbolic Logic, 47(1), 1982.Google Scholar
Cross Ref
- Noam Zeilberger. The Logical Basis of Evaluation Order and Pattern-Matching . PhD thesis, Carnegie Mellon University, 2009. Google Scholar
Digital Library
Index Terms
Deciding equivalence with sums and the empty type
Recommendations
Which simple types have a unique inhabitant?
ICFP '15We study the question of whether a given type has a unique inhabitant modulo program equivalence. In the setting of simply-typed lambda-calculus with sums, equipped with the strong --equivalence, we show that uniqueness is decidable. We present a ...
Deciding equivalence with sums and the empty type
POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesThe logical technique of focusing can be applied to the λ-calculus; in a simple type system with atomic types and negative type formers (functions, products, the unit type), its normal forms coincide with βη-normal forms. Introducing a saturation phase ...
Which simple types have a unique inhabitant?
ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional ProgrammingWe study the question of whether a given type has a unique inhabitant modulo program equivalence. In the setting of simply-typed lambda-calculus with sums, equipped with the strong --equivalence, we show that uniqueness is decidable. We present a ...







Comments