| Display title | Logic of Computable Functions |
| Default sort key | Logic of Computable Functions |
| Page length (in bytes) | 1,351 |
| Namespace ID | 0 |
| Page ID | 313669 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>WikiEditor |
| Date of page creation | 09:55, 24 October 2022 |
| Latest editor | imported>WikiEditor |
| Date of latest edit | 09:55, 24 October 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Logic of Computable Functions (LCF) is a deductive system for computable functions proposed by Dana Scott in 1969 in a memorandum unpublished until 1993. It inspired:
Logic for Computable Functions (LCF), theorem proving logic by Robin Milner.
Programming Computable Functions (PCF), small theoretical... |
