scientific article; zbMATH DE number 1303339

MaRDI QIDQ4249892zbMATH OpenFDO

Authors Bruno Pagano

Publication date 15 November 1999

zbMATH Keywords

\(\lambda\)-calculusconfluenceexplicit reduction systemsfirst-order term rewriting systemsubstitution mechanism of general higher-order systems

Mathematics Subject Classification ID

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

Recommendations

• Expressing combinatory reduction systems derivations in the rewriting calculus
• The Rewriting Calculus as a Combinatory Reduction System
• Types for Proofs and Programs
• Reduction system for extensional lambda-mu calculus
• Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
• Reduction rules for intuitionistic \(\lambda\rho\)-calculus
• Publication:4945227
• Reducibility Proofs in the λ-Calculus
• Combinatory reduction systems: Introduction and survey

Cited in

(3)

• Expressing combinatory reduction systems derivations in the rewriting calculus
• A \(\rho\)-calculus of explicit constraint application
• CINNI -- a generic calculus of explicit substitutions and its application to \(\lambda\)-, \(\sigma\)- and \(\pi\)-calculi

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249892)