Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Agda / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matita / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Automath / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1791042548 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1509.00649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination checking with types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matita Interactive Theorem Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brief Overview of Agda – A Functional Language with Dependent Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of strong normalization in the algebraic-λ-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-based termination of recursive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive-data-type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computability Path Ordering: The End of a Quest / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computability path ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating Higher-order and First-order Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definitions by rewriting in the Calculus of Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability Closure: Ten Years Later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relation between Sized-Types Based Termination and Semantic Labelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic rewriting conserves algebraic strong normalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive versions of Tarski's fixed point theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculus of constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining algebraic rewriting, extensional lambda calculi, and fixpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rewriting calculus - part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rewriting calculus - part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding algebraic rewriting to the untyped lambda calculus (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding algebraic rewriting to the untyped lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Interpretations for Higher-Order Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes, Terms and Cycles: Steps on the Road to Infinity / rank
 
Normal rank
Property / cites work
 
Property / cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized sufficient conditions for modular termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An initial algebra approach to term rewriting systems with variable binders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion of a Set of Rules Modulo a Set of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-class patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract data type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Order Orderings for Normal Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic higher-order recursive path orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Calculi with Explicit Substitutions Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3356291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2740996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda calculus with patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatory reduction systems: Introduction and survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Order   Matching is Undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of combined (rewrite and λ-calculus) systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order rewrite systems and their confluence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of strong normalisation for second order classical natural deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing recursion operators in intuitionistic type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of the normalization and Church-Rosser theorems for the typed \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Sets of Reductions for Some Equational Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear unification of higher-order patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stability by Union of Reducibility Candidates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functionals defined by recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typed lambda-calculus is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of higher-order matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Medial as Rewriting Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel reductions in \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to termination for the direct sum of term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent types for program termination verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847000 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:38, 11 July 2024

scientific article
Language Label Description Also known as
English
Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
scientific article

    Statements

    Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (English)
    0 references
    0 references
    15 December 2015
    0 references
    termination
    0 references
    rewriting
    0 references
    \(\lambda\)-calculus
    0 references
    types
    0 references
    Girard's reducibility
    0 references
    rewriting modulo
    0 references
    matching modulo \(\beta\eta\)
    0 references
    patterns à la Miller
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers