Term Collections in λ and ρ-calculi

DOI10.1016/J.ENTCS.2006.12.037zbMath1277.03010OpenAlexW2019313571MaRDI QIDQ2864209

Germain Faure

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.12.037

zbMATH Keywords

lambda-calculusparallel operatorcanonical setsrho-calculusterm collections

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Uses Software

• ELAN
• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lambda-calculi for (strict) parallel functions
• The differential lambda-calculus
• Normalized rewriting: An alternative to rewriting modulo a set of equations
• Canonical Abstract Syntax Trees
• Pure patterns type systems
• The recognition of certain Hausdorff like measures
• Types for Proofs and Programs
• Parallel reductions in \(\lambda\)-calculus

This page was built for publication: Term Collections in λ and ρ-calculi