Classical Logic with Mendler Induction - A Dual Calculus and Its Strong Normalization
نویسندگان
چکیده
We investigate (co-)induction in Classical Logic under the propositions-as-types paradigm, considering propositional, second-order, and (co-)inductive types. Specifically, we introduce an extension of the Dual Calculus with a Mendler-style (co-)iterator that remains strongly normalizing under head reduction. We prove this using a non-constructive realizability argument.
منابع مشابه
Strong Normalization of the Dual Classical Sequent Calculus
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λμ calculus corresponds to classical natural deduction. Our main result is strong normalization theorem for reduction in the dual calculus; we also prove some confluence results for the typed and untyped versions of the system.
متن کاملA Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
We propose a term assignment (let calculus) for Intuitionistic Logic for Pragmatics ILPAC, a polarized sequent calculus which includes ordinary positive intuitionistic logic LJ, its dual LJ and dual negations ( ) which allow a formula to “communicate” with its dual fragment. We prove the strong normalization property for the term assignment which follows by soundly translating the let calculus ...
متن کاملStrong normalization of a symmetric lambda calculus for second-order classical logic
We extend Barbanera and Berardi’s symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
متن کاملTermination Checking with Types Strong Normalization for Mendler-Style Course-Of-Value Recursion
Giménez’ type system for structural recursion in the Calculus of Constructions is adapted to typed functional programming. As core language, the λ-calculus with inductive types, subtyping and bounded quantification is introduced. Decorated type variables, which represent approximations of inductive types, enable the type system to track the size of arguments to recursive functions and the size ...
متن کاملInvestigations on the Dual Calculus
The Dual Calculus, proposed recently by Wadler, is the outcome of two distinct lines of research in theoretical computer science: A. Efforts to extend the Curry-Howard isomorphism, established between the simply-typed lambda calculus and intuitionistic logic, to classical logic. B. Efforts to establish the tacit conjecture that call-by-value reduction in lambda calculus is dual to call-by-name ...
متن کامل