A combinatory account of internal structure
From MaRDI portal
Recommendations
Cites work
- An Unsolvable Problem of Elementary Number Theory
- Combinatory logic. Vol. II
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- First-class patterns
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- Proving Properties of Programs by Structural Induction
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Tree-Manipulating Systems and Church-Rosser Theorems
Cited in
(9)- Intensional computation with higher-order functions
- Programs as data structures in \(\lambda\)SF-calculus
- Self-quotation in a typed, intensional lambda-calculus
- Expressiveness of concurrent intensionality
- On the expressiveness of symmetric communication
- Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
- Encoding the factorisation calculus
- scientific article; zbMATH DE number 7204439 (Why is no real title available?)
- Conflicting accounts of \(\lambda\)-definability
This page was built for publication: A combinatory account of internal structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173527)
