On the Values of Reducibility Candidates

DOI10.1007/978-3-642-02273-9_20zbMath1246.03031OpenAlexW1507801349MaRDI QIDQ3637200

Colin Riba

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02273-9_20

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (1)

Size-based termination of higher-order rewriting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection and union types: Syntax and semantics
• The duality of computation
• Semantic types
• Tridirectional typechecking
• Union of Reducibility Candidates for Orthogonal Constructor Rewriting
• Simple Saturated Sets for Disjunction and Second-Order Existential Quantification
• A Filter Model for Concurrent $\lambda$-Calculus
• Proofs of strong normalisation for second order classical natural deduction
• Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems
• A proof of strong normalisation using domain theory
• Typed Lambda Calculi and Applications
• Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models

This page was built for publication: On the Values of Reducibility Candidates