I wonder what's the computational power of untyped linear lambda calculus?
Pretty sure it's not Turing complete, I don't think you can write a fixpoint combinator or any other kind of recursor without breaking linearity
I wonder what's the computational power of untyped linear lambda calculus?
Pretty sure it's not Turing complete, I don't think you can write a fixpoint combinator or any other kind of recursor without breaking linearity
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.