On the Stability by Union of Reducibility Candidates

DOI10.1007/978-3-540-71389-0_23zbMath1142.03335OpenAlexW1525058018MaRDI QIDQ5758042

Colin Riba

Publication date: 7 September 2007

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71389-0_23

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Size-based termination of higher-order rewriting ⋮ Mixed Inductive/Coinductive Types and Strong Normalization ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ A Polymorphic Type System for the Lambda-Calculus with Constructors ⋮ A note on subject reduction in \((\to, \exists)\)-Curry with respect to complete developments

Uses Software

• Automath

This page was built for publication: On the Stability by Union of Reducibility Candidates