Equational programming in \(\lambda\)-calculus via SL-systems. Part 1
From MaRDI portal
Publication:1350516
DOI10.1016/0304-3975(95)00105-0zbMath0872.68011OpenAlexW1990479768MaRDI QIDQ1350516
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00105-0
\(\lambda\)-calculusfunctional programmingequational programmingautomated synthesis of programssystems of equations in the \(\lambda\)-calculus
Related Items (2)
Equational programming in \(\lambda\)-calculus via SL-systems. Part 1 ⋮ Equational programming in \(\lambda\)-calculus via SL-systems. Part 2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sets of solutions to combinator equations
- About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- Equational programming in \(\lambda\)-calculus via SL-systems. Part 1
- Equational programming in \(\lambda\)-calculus via SL-systems. Part 2
- REGULAR SYSTEMS OF EQUATIONS IN λ-CALCULUS
This page was built for publication: Equational programming in \(\lambda\)-calculus via SL-systems. Part 1