Many more predecessors: A representation workout
From MaRDI portal
Publication:5110930
DOI10.1017/S095679682000009XzbMath1444.03018OpenAlexW3015044195MaRDI QIDQ5110930
Publication date: 26 May 2020
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s095679682000009x
Cites Work
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- The lambda calculus, its syntax and semantics
- The typed lambda-calculus is not elementary recursive
- The Impact of the Lambda Calculus in Logic and Computer Science
- Efficient self-interpretation in lambda calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Many more predecessors: A representation workout