2000 character limit reached
Normalisation of a Non-deterministic Type Isomorphic λ-calculus
Published 21 Jun 2013 in cs.LO | (1306.5089v3)
Abstract: We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility candidates technique.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.