A discrimination algorithm inside --calculus
From MaRDI portal
A discrimination algorithm inside \(\lambda -\beta\)-calculus
Cites work
- scientific article; zbMATH DE number 3485195 (Why is no real title available?)
- scientific article; zbMATH DE number 3532922 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3423994 (Why is no real title available?)
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
Cited in
(14)- Effective applicative structures
- An algebraic view of the Böhm-out technique
- scientific article; zbMATH DE number 7243677 (Why is no real title available?)
- An analysis of Böhm's theorem
- General recursive functions in a very simply interpretable typed \(\lambda\)-calculus
- Böhm's theorem for resource lambda calculus through Taylor expansion
- About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus
- The discrimination theorem holds for combinatory weak reduction
- Strong storage operators and data types
- Storage operators and directed lambda-calculus
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
- Parametric \(\lambda \)-theories
- Efficient lambda encodings for Mendler-style coinductive types in Cedille
- Monotone recursive types and recursive data representations in Cedille
This page was built for publication: A discrimination algorithm inside \(\lambda -\beta\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1257009)
