Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Lambda-calculus terms that reduce to themselves

From MaRDI portal
Publication:1224573
Jump to:navigation, search

DOI10.1305/ndjfl/1093887539zbMath0324.02016OpenAlexW2009997478MaRDI QIDQ1224573

Bruce Lercher

Publication date: 1976

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093887539



Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)


Related Items (4)

Highlights in infinitary rewriting and lambda calculus ⋮ The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. ⋮ Perpetual reductions in \(\lambda\)-calculus ⋮ Reduction graphs in the lambda calculus




This page was built for publication: Lambda-calculus terms that reduce to themselves

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1224573&oldid=13298235"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 08:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki