A faithful and quantitative notion of distant reduction for generalized applications

DOI10.1007/978-3-030-99253-8_15arXiv2201.04156OpenAlexW4225832821MaRDI QIDQ6181933

Delia Kesner, José Espírito Santo, Loïc Peyrot

Publication date: 23 January 2024

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

Full work available at URL: https://arxiv.org/abs/2201.04156

zbMATH Keywords

lambda-calculusgeneralized applicationsquantitative types

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An equivalence between lambda- terms
• Natural deduction with general elimination rules
• Structural Proof Theory as Rewriting
• The Structural λ-Calculus
• Delayed Substitutions

This page was built for publication: A faithful and quantitative notion of distant reduction for generalized applications